The Extremal Function for Complete Minors

Journal of Combinatorial Theory. Series B

Volumn 81, Issue 2, 2001, Pages 318-338

  Thomason, Andrew ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012819185     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2000.2013     Document Type: Article

References (26)

1. N. Alon and J. Spencer, "The Probabilistic Method," Wiley, New York, 1992.
2. B. Bollobás, "Extremal Graph Theory," Academic Press, London, 1978.
3. B. Bollobâs, "Random Graphs," Academic Press, London/New York, 1985.
4. B. Bollobás, P. Catlin, and P. Erdos, Hadwiger's conjecture is true for almost every graph, Europ. J. Combin. Theory 1 (1980), 195-199.
5. B. Bollobás, B. Reed, and A. Thomason, An extremal function for the achromatic number, Contemp. Math. 147 (1993), 161-165.
6. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Statist. 23 (1952), 493-509.
7. F. R. K. Chung, R. L. Graham, and R. M. Wilson, Quasi-random graphs, Combinatorica 9 (1989), 345-362.
8. s, Discrete Math. 46 (1983), 109-110.
9. G. A. Dirac, Homomorphism theorems for graphs, Math. Ann. 153 (1964), 69-80.
10. 4, Discrete Math. 130 (1994), 57-68.
11. Z. Füredi, unpublished.
12. H. Hadwiger, Über eine Klassifikation der Streckenkomplexe, Vierteljahresschr. Naturforsch. Ges. Zürich 88 (1943), 133-142.
13. H. Jacob and H. Meyniel, Extensions of Turán's and Brooks's theorems and new motions of stability and colouring in digraphs, Ann. Discrete Math. 17 (1983), 365-370.
14. C. Jagger, An extremal function for digraph subcontraction, J. Graph Theory 21 (1996), 343-350.
15. C. Jagger, Tournaments as strong subcontractions, Discrete Math. 176 (1997), 177-184.
16. 8, J. Graph Theory 18 (1994), 431-448.
17. A. Karabeg and D. Karabeg, Graph compaction, in "Graph Theory Notes of New York" (J. W. Kennedy and L. V. Quintas, Eds.), Vol. 21, pp. 44-51, New York Academy of Sciences, New York, 1991.
18. A. V. Kostochka, The minimum Hadwiger number for graphs with a given mean degree of vertices, Metody Diskret. Analiz. 38 (1982), 37-58 [in Russian].
19. A. V. Kostochka, A lower bound for the Hadwiger number of graphs by their average degree, Combinatorica 4 (1984), 307-316.
20. W. Mader, Homomorphieeigenschaften und mittlere Kantendichte von Graphen, Math. Ann. 174 (1967), 265-268.
21. W. Mader, Homomorphiesätze für Graphen, Math. Ann. 178 (1968), 154-168.
22. W. Mader, personal communication.
23. A. Thomason, An extremal function for contractions of graphs, Math. Proc. Cambridge Philos. Soc. 95 (1984), 261-265.
24. A. Thomason, Pseudo-random graphs, in "Random Graphs '85" (M. Karonski and Z. Palka, Eds.), Annals of Discrete Math., Vol. 33, pp. 307-331, 1987.
25. A. Thomason, Complete minors in pseudo-random graphs, Random Structures and Algorithms 17 (2000), 26-28.
26. K. Wagner, Beweis einer Abschwächung der Hadwiger-Vermutung, Math. Ann. 153 (1964), 139-141.