Forcing unbalanced complete bipartite minors

European Journal of Combinatorics

Volumn 26, Issue 1, 2005, Pages 75-81

  Kühn, Daniela ^a   Osthus, Deryk ^b  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4644363545     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2004.02.002     Document Type: Article

References (13)

1. Bollobás B. Catlin P.A. Erdos P. Hadwiger's conjecture is true for almost every graph European J. Combin. 1 1980 195-199
2. Bollobás B. Thomason A. Highly linked graphs Combinatorica 16 1996 313-320
3. K. Kawarabayashi, A.V. Kostochka, G. Yu, On sufficient degree conditions for a graph to be k-linked, 2003 (preprint)
4. Kostochka A.V. A lower bound for the Hadwiger number of graphs by the average degree Combinatorica 4 1984 307-316
5. s,t-minors in graphs with given average degree, 2004 (preprint)
6. Mader W. Homomorphieeigenschaften und mittlere Kantendichte von Graphen Math. Ann. 174 1967 265-268
7. Mader W. Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte Abh. Math. Sem. Univ. Hamburg 37 1972 86-97
8. Myers J.S. Graphs without large complete minors are quasi-random Combin. Probab. Comput. 11 2002 571-585
9. Myers J.S. The extremal function for unbalanced bipartite minors Discrete Math. 271 2003 209-222
10. J.S. Myers, A. Thomason, The extremal function for noncomplete minors, Combinatorica (in press)
11. R. Thomas, P. Wollan, An improved linear edge bound for graph linkages, 2003 (preprint)
12. Thomason A. An extremal function for contractions of graphs Math. Proc. Cambridge Philos. Soc. 95 1984 261-265
13. A. Thomason, The extremal function for complete minors, J. Combin. Theory B 81 (2001) 318-338