Linear connectivity forces large complete bipartite minors

Journal of Combinatorial Theory. Series B

Volumn 99, Issue 3, 2009, Pages 557-582

  Böhme, Thomas ^a   Kawarabayashi, Ken ichi ^b   Maharry, John ^c   Mohar, Bojan ^d  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^b TOHOKU UNIVERSITY   (Japan)

^c OHIO STATE UNIVERSITY   (United States)

^d UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

Complete bipartite minor; Complete graph minor; Connectivity; Erdo combining double acute accent s P sa property; Euler's formula; Graph minor; Graphs on surfaces; Grid minor; Hadwiger conjecture; k linked; Near embedding; Path decomposition; Tree decomposition; Tree width; Unavoidable minor; Vortex structure

Indexed keywords

EID: 67649435962     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2008.07.006     Document Type: Article

References (72)

1. Appel K., and Haken W. Every planar map is four colorable, Part I. Discharging. Illinois J. Math. 21 (1977) 429-490
2. Appel K., Haken W., and Koch J. Every planar map is four colorable, Part II. Reducibility. Illinois J. Math. 21 (1977) 491-567
3. Arnborg S., and Proskurowski A. Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23 (1989) 11-24
4. 3, k-minors in large 7-connected graphs, submitted for publication
5. r-minors in large graphs with given average degree. European J. Combin. 26 (2005) 289-292
6. a, k minors in graphs of bounded tree-width. J. Combin. Theory Ser. B 86 (2002) 133-147
7. Bollobás B., and Thomason A. Highly linked graphs. Combinatorica 16 (1996) 313-320
8. Diestel R. Graph Decompositions-A Study in Infinite Graph Theory (1990), Oxford University Press, Oxford
9. Diestel R. Graph Theory. second ed. (2000), Springer-Verlag
10. Diestel R., Gorbunov K.Yu., Jensen T.R., and Thomassen C. Highly connected sets and the excluded wall theorem. J. Combin. Theory Ser. B 75 (1999) 61-73
11. R. Diestel, K. Kawarabayashi, T. Muller, P. Wollan, On the excluded minor theorem in graphs of large treewidth, preprint
12. G. Ding, private communication
13. Dirac G.A. A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc. 27 (1952) 85-92
14. Dirac G.A. Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem. J. Reine Angew. Math. 204 (1960) 116-131
15. Dirac G.A. On the structure of 5- and 6-chromatic abstract graphs. J. Reine Angew. Math. 214/215 (1964) 43-52
16. Erdo{combining double acute accent}s P., and Pósa L. On the maximal number of disjoint circuits of a graph. Publ. Math. Debrecen 9 (1962) 3-12
17. Erdo{combining double acute accent}s P., and Szekeres G. A combinatorial problem in geometry. Compos. Math. 2 (1935) 463-470
18. D. Fon-Der-Flaass, private communication
19. Hadwiger H. Über eine Klassifikation der Streckenkomplexe. Vierteljahrsschr. Naturforsch. Ges. Zürich 88 (1943) 133-142
20. Halin R. S-function for graphs. J. Geom. 8 (1976) 171-186
21. Johnson T., and Thomas R. Generating internally four-connected graphs. J. Combin. Theory Ser. B 85 (2002) 21-58
22. 8. J. Graph Theory 18 (1994) 431-448
23. L. Jørgensen, K. Kawarabayashi, Minors in 7-chromatic graphs, in preparation
24. Juvan M., Marinček J., and Mohar B. Elimination of local bridges. Math. Slovaca 47 (1997) 85-92
25. Kawarabayashi K. On the connectivity of minimal counterexamples to Hadwiger's conjecture. J. Combin. Theory Ser. B 97 (2007) 144-150
26. K. Kawarabayashi, J. Maharry, Minors in large non-planar 5-connected graphs, submitted for publication
27. K. Kawarabayashi, J. Maharry, Unavoidable minors in large 5-connected graphs, in preparation
28. Kawarabayashi K., Kostochka A., and Yu G. On sufficient degree conditions for a graph to be k-linked. Combin. Probab. Comput. 15 (2006) 685-694
29. Kawarabayashi K., and Mohar B. Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. 38th Symposium on the Theory of Computing (STOC) (2006) 401-416
30. 4, k-minors in large 9-connected graphs, in preparation
31. Kawarabayashi K., and Mohar B. A relaxed Hadwiger's conjecture for list colorings. J. Combin. Theory Ser. B 97 (2007) 647-651
32. 5-minors with minimum degree at least 7, in preparation
33. 4, 4 as a minor. Combinatorica 25 (2005) 327-353
34. Kostochka A. The minimum Hadwiger number for graphs with a given mean degree of vertices. Metody Diskret. Analiz. 38 (1982) 37-58 (in Russian)
35. Kostochka A. Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica 4 (1984) 307-316
36. s, t-minors in graphs with given average degree, preprint
37. Kühn D., and Osthus D. Forcing unbalanced complete bipartite minors. European J. Combin. 26 (2005) 75-81
38. Mader W. Homomorphiesätze für Graphen. Math. Ann. 178 (1968) 154-168
39. Mader W. Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend grosser Kantendichte. Abh. Math. Sem. Univ. Hamburg 37 (1972) 86-97
40. W. Mader, private communication
41. Maharry J. An excluded minor theorem for the octahedron. J. Graph Theory 31 (1999) 95-100
42. Maharry J. A characterization of graphs with no cube minor. J. Combin. Theory Ser. B 80 (2000) 179-201
43. Mohar B. Graph minors and graphs on surfaces. Surveys in Combinatorics. Sussex, 2001. London Math. Soc. Lecture Note Ser. vol. 288 (2001), Cambridge Univ. Press, Cambridge 145-163
44. B. Mohar, Problem of the month, Fall 2003, http://www.fmf.uni-lj.si/~mohar/
45. Mohar B., and Thomassen C. Graphs on Surfaces (2001), Johns Hopkins University Press, Baltimore, MD
46. Myers J. The extremal function for unbalanced bipartite minors. Discrete Math. 271 (2003) 209-221
47. J. Myers, A. Thomason, The extremal function for noncomplete graph minors, Combinatorica, in press
48. Oporowski B., Oxley J., and Thomas R. Typical subgraphs of 3- and 4-connected graphs. J. Combin. Theory Ser. B 57 (1993) 239-257
49. Reed B. Tree width and tangles: A new connectivity measure and some applications. Surveys in Combinatorics. London, 1997. London Math. Soc. Lecture Note Ser. vol. 241 (1997), Cambridge Univ. Press, Cambridge 87-162
50. Reed B. Mangoes and blueberries. Combinatorica 19 (1999) 267-296
51. Reed B., and Seymour P.D. Fractional colouring and Hadwiger's conjecture. J. Combin. Theory Ser. B 74 (1998) 147-152
52. N. Robertson, private communication
53. Robertson N., Sanders D.P., Seymour P.D., and Thomas R. The four-color theorem. J. Combin. Theory Ser. B 70 (1997) 2-44
54. Robertson N., and Seymour P.D. Graph minors. III. Planar tree-width. J. Combin. Theory Ser. B 36 (1984) 49-63
55. Robertson N., and Seymour P.D. Graph minors. V. Excluding a planar graph. J. Combin. Theory Ser. B 41 (1986) 92-114
56. Robertson N., and Seymour P.D. Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52 (1991) 153-190
57. Robertson N., and Seymour P.D. Excluding a graph with one crossing. Contemp. Math. vol. 147 (1993) 669-675
58. Robertson N., and Seymour P.D. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B 63 (1995) 65-110
59. Robertson N., and Seymour P.D. Graph minors. XV. Giant steps. J. Combin. Theory Ser. B 68 (1996) 112-148
60. Robertson N., and Seymour P.D. Graph minors. XVII. Taming a vortex. J. Combin. Theory Ser. B 77 (1999) 162-210
61. Robertson N., and Seymour P.D. Graph minors. XVI. Excluding a non-planar graph. J. Combin. Theory Ser. B 89 (2003) 43-76
62. 6-free graphs. Combinatorica 13 (1993) 279-361
63. Robertson N., Seymour P.D., and Thomas R. Quickly excluding a planar graph. J. Combin. Theory Ser. B 62 (1994) 323-348
64. 9 minors. J. Combin. Theory Ser. B 96 (2006) 240-252
65. Thomas R. Recent excluded minor theorems for graphs. Surveys in Combinatorics. Canterbury, 1999 (1999), Cambridge Univ. Press, Cambridge 201-222
66. Thomas R., and Wollan P. An improved linear edge bound for graph linkages. European J. Combin. 26 (2005) 309-324
67. Thomason A. An extremal function for contractions of graphs. Math. Proc. Cambridge Philos. Soc. 95 (1984) 261-265
68. Thomason A. The extremal function for complete minors. J. Combin. Theory Ser. B 81 (2001) 318-338
69. Thomason A. Two minor problems. Combin. Probab. Comput. 13 (2004) 413-414
70. Thomassen C. Color-critical graphs on a fixed surface. J. Combin. Theory Ser. B 70 (1997) 67-100
71. Wagner K. Über eine Eigenschaft der ebenen Komplexe. Math. Ann. 114 (1937) 570-590
72. Wagner K. Beweis einer Abschwächung der Hadwiger-Vermutung. Math. Ann. 153 (1964) 139-141