Abstract
AbstractThe function c(p) is defined for positive integers p ≥ 4 bywhere > denotes contraction. Random graph examples showIn 1968 Mader showed that c(p) ≤ 8(p − 2) [log2 (p − 2)] and more recently Kostochka showed that p√(log p) is the correct order for c(p). We present a simple argument showing c(p) ≤ 2.68p √(log2p)(l + ο(l)).
Publisher
Cambridge University Press (CUP)
Reference4 articles.
1. Homomorphies�tze f�r Graphen
2. Hadwiger's Conjecture is True for Almost Every Graph
3. A lower bound for the Hadwiger number of a graph as a function of the average degree of its vertices;Kostochka;Discret. Analyz. Novosibirsk,1982
Cited by
195 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献