Graphs without large complete minors are quasi-random

Combinatorics Probability and Computing

Volumn 11, Issue 6, 2002, Pages 571-582

  Myers, Joseph Samuel ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

PERMUTATION; QUASI-RANDOM; RANDOM GRAPH;

GRAPH THEORY;

EID: 0036026963     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096354830200531X     Document Type: Article

References (12)

1. Bollobás, B., Catlin, P. A. and Erdõs, P. (1980) Hadwiger's conjecture is true for almost every graph. Europ. J. Combin. 1 195-199.
2. Bollobás, B. (1998) Modern Graph Theory, Springer.
3. Chung, F. R. K., Graham, R. L. and Wilson, R. M. (1989) Quasi-random graphs. Combinatorica 9 345-362.
4. s. Discrete Math. 46 109-110.
5. Kostochka, A. V. (1982) The minimum Hadwiger number for graphs with a given mean degree of vertices. Metody Diskret. Analiz. 38 37-58 In Russian.
6. Kostochka, A. V. (1984) Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica 4 307-316.
7. Mader, W. (1972) Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. Arch. Math. (Basel) 23 553-560.
8. Myers, J. S. (2001) An inequality arising in graph minors. http://www.srcf.ucam.org/-jsm28/publications/2001/minors-inequality/ps.
9. Myers, J. S. 2002 Extremal theory of graph minors and directed graphs (provisional dissertation title). PhD dissertation, University of Cambridge. In preparation.
10. Thomason S. (1987) Pseudo-random graphs. In Random Graphs '85 (M. Karoński and Z. Palka, eds). Vol. 33 of Ann. Discrete Math., North-Holland, pp. 307-331.
11. Thomason, A. (2000) Complete minors in pseudo-random graphs. Random Struct. Alg. 17 26-28.
12. Thomason, A. (2001) The extremal function for complete minors. J. Combin. Theory Ser. B 81 318-338.