Two minor problems

Combinatorics Probability and Computing

Volumn 13, Issue 3, 2004, Pages 413-414

  Thomason, Andrew ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; FUNCTIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

DISJOINT UNIONS; PLANAR GRAPHS; PSEUDO-RANDOM GRAPHS; VERTEX CONNECTIVITY;

GRAPH THEORY;

EID: 3142657432     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548304006236     Document Type: Note

References (12)

1. Hadwiger, H. (1943) Über eine Klassifikation der Streckenkomplexe, Vierteljahresschr. Naturforsch. Ges. Zürich 88 133-142.
2. Kostochka, A. V. (1982) The minimum Hadwiger number for graphs with a given mean degree of vertices (in Russian), Metody Diskret. Analiz. 38 37-58.
3. Mader, W. (1967) Homomorphieeigenschaften und mittlere Kantendichte von Graphen, Math. Ann. 174 265-268.
4. Myers, J. S. (2002) Graphs without large complete minors are quasi-random, Combinatorics, Probability and Computing 11 571-585.
5. Myers, J. S. (2003) Extremal theory of graph minors and directed graphs, Ph.D. thesis, University of Cambridge.
6. 6-free graphs, Combinatorica 13 279-361.
7. Thomas, R. (personal communication, 2002).
8. Thomason, A. (1984) An extremal function for contractions of graphs, Math. Proc. Cambridge Phil. Soc. 95 261-265.
9. Thomason, A. (2001) The extremal function for complete minors, J. Combinatorial Theory Ser. B 81 318-338.
10. Thomason, A. Extremal functions for graph minors, (survey to appear in "Finite and Infinite Combinatorics").
11. Thomason, A. (2000) Complete minors in pseudo-random graphs, Random Structures and Algorithms 17 26-28.
12. Wagner, K. (1937) Über eine Eigenschaft der ebenen Komplexe, Math. Ann. 114 570-590.