, Volume 4, Issue 4, pp 307–316

Lower bound of the hadwiger number of graphs by their average degree

  • A. V. Kostochka

DOI: 10.1007/BF02579141

Cite this article as:
Kostochka, A.V. Combinatorica (1984) 4: 307. doi:10.1007/BF02579141


The aim of this paper is to show that the minimum Hadwiger number of graphs with average degreek isO(k/√logk). Specially, it follows that Hadwiger’s conjecture is true for almost all graphs withn vertices, furthermore ifk is large enough then for almost all graphs withn vertices andnk edges.

AMS subject classification 1980)

05 C 10 05 C 15 60 C 05 

Copyright information

© Akadémiai Kiadó 1984

Authors and Affiliations

  • A. V. Kostochka
    • 1
  1. 1.Mathematical Institute of the Siberian Branch of theSoviet Academy of SciencesU.S.S.R.

Personalised recommendations