Lower bound of the hadwiger number of graphs by their average degree
暂无分享,去创建一个
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.
[1] Bohdan Zelinka. On some graph-theoretical problems of V. G. Vizing , 1973 .
[2] W. Mader. Homomorphiesätze für Graphen , 1968 .
[3] K. Wagner. Beweis einer Abschwächung der Hadwiger-Vermutung , 1964 .
[4] Zevi Miller,et al. Contractions of graphs: A theorem of ore and an extremal problem , 1978, Discret. Math..
[5] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .