Home
Hostname: page-component-99c86f546-kpmwg Total loading time: 0.391 Render date: 2021-12-06T07:46:17.119Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true, "newUsageEvents": true }

Published online by Cambridge University Press:  05 May 2015

## Summary

Hadwiger's conjecture states that any graph that does not have the complete graph Kk as a minor is (k − 1)-colourable. It is well known that the case k = 5 is equivalent to the four-colour theorem. In 1993 Robertson, Seymour and Thomas proved that the case k = 6 is also equivalent to the four-colour theorem. For k ≥ 7, the conjecture is still open. Our main focus in this chapter is to present recent results related to minimal counter-examples to Hadwiger's conjecture and some variations. We also consider algorithmic aspects of the conjecture and some of its variants, including the list-colouring version (which is false), the odd case of the conjecture, Hajós's conjecture and totally odd subdivisions, and Hadwiger's conjecture for some special classes of graphs.

Introduction

This chapter is motivated by Hadwiger's conjecture from 1943, which suggests a farreaching generalization of the four-colour theorem. It is among the most challenging open problems in all of graph theory.

Hadwiger's conjecture (strong version) For all k, every k-colourable graph contains the complete graph Kk as a minor.

For k ≤ 3, Hadwiger's conjecture is easy to prove, and for k = 4, it was proved independently by Hadwiger himself [31] and Dirac [21]. For k = 5, however, it becomes extremely difficult. In 1937 Wagner [74] proved that this case is equivalent to the four-colour theorem, so, given that result in [2], [3], [56], it follows that the case k = 5 also holds. In the deepest theorem in this area so far, Robertson, Seymour and Thomas [62] proved in 1993 that a minimal counter-example to the case k = 6 must have a vertex whose removal leaves a planar graph, so this case too follows from the four-colour theorem. For k ≥ 7, the conjecture is still open. For k = 7, Kawarabayashi and Toft [46] proved that every 7-chromatic graph has K7 or K4,4 as a minor, and recently Kawarabayashi [38] proved that every 7-chromatic graph has K7 or K3,5 as a minor.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2015

## Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

### Purchase

Buy print or eBook[Opens in a new window]

## References

1. and , Graph coloring and the immersion order, to appear.
2. and , Every planar map is four colorable, Part I. Discharging, Illinois J. Math. 21 (1977), 429–190.Google Scholar
3. , and , Every planar map is four colorable, Part II. Reducibility, Illinois J. Math. 21 (1977), 491–567.Google Scholar
4. and , Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Appl. Math. 23 (1989), 11–24.Google Scholar
5. and , Large minors in graphs with given independent number, Discrete Math. 311 (2011), 2204–2215.Google Scholar
6. , and , Complete minors, independent sets, and chordal graphs, Discuss. Math. Graph Theory, to appear.
7. , and , Disproof of the list Hadwiger conjecture, Electron. J. Combin. 18 (2011), P232.Google Scholar
8. , A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput. 25 (1996), 1305–1317.Google Scholar
9. , , and , Linear connectivity forces large complete bipartite minors, J. Combin. Theory (B) 99 (2009), 557–582.Google Scholar
10. and , Topological cliques of random graphs, J. Combin. Theory (B) 30 (1981), 224–227.Google Scholar
12. , , and , Sequential and parallel algorithms for K4-immersion testing, J. Algorithms 30 (1999), 344–378.Google Scholar
13. , A bound on the chromatic number of a graph, Discrete Math. 22 (1978), 81–83.Google Scholar
14. , and , Graphs with forbidden subgraphs, J. Combin. Theory (B) 10 (1971), 12–41.Google Scholar
15. and , Hadwiger's conjecture for quasi-line graphs, J. Graph Theory 59 (2008), 17–33.Google Scholar
16. and , Packing seagulls, Combinatorica, to appear.
17. , On certain polytopes associated with graphs, J. Combin. Theory (B) 18 (1975), 138–154.Google Scholar
18. , , , , and , A minimum degree condition forcing complete graph immersion, Combinatorica 34 (2014), 279–298.Google Scholar
19. , , and , Immersing small complete graphs, Ars Math. Contemp. 3 (2010), 139–146.Google Scholar
20. , Graph Theory (2nd edn.), Springer, 2000.Google Scholar
21. , A property of 4-chromatic graphs and some remarks on critical graphs, J. London Math. Soc. 27 (1952), 85–92.Google Scholar
22. , Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem, J. Reine Angew. Math. 204 (1960), 116–131.Google Scholar
23. , Homomorphism theorems for graphs, J. Reine Angew. Math. 153 (1964), 69–80.Google Scholar
24. , On the structure of 5- and 6-chromatic abstract graphs, Math. Ann. 214/215 (1964), 43–52.Google Scholar
25. and , On Hadwiger's number and the stability number, Graph Theory (Cambridge, 1981), North-Holland (1982), 71–73.Google Scholar
26. and , On the conjecture of Hajós, Combinatorica 1 (1981), 141–143.Google Scholar
27. , Complete minors and independence number, SIAM J. Discrete Math. 24 (2010) 1313–1321.Google Scholar
28. , Clique minors in claw-free graphs, J. Combin. Theory (B) 102 (2012), 71–85.Google Scholar
29. , , , and , On the odd variant of Hadwiger's conjecture, J. Combin. Theory (B) 99 (2009), 20–29.Google Scholar
30. , An extension of Konig's theorem to graphs with no odd-K4, J. Combin. Theory (B) 47 (1989), 330–348.Google Scholar
31. , Über eine Klassifikation der Streckenkomplexe, Vierteljschr. Naturforsch. Ges. Zurich 88 (1943), 133–142.Google Scholar
32. , and , Computing vertex connectivity: new bounds from old techniques, J. Algorithms 34 (2000), 222–250.Google Scholar
33. and , Graph Coloring Problems, Wiley–Interscience, 1995.Google Scholar
34. , Contraction to K8, J. Graph Theory 18 (1994), 431–448.Google Scholar
35. , Rooted minors problem in highly connected graphs, Discrete Math. 287 (2004), 121–123.Google Scholar
36. , On the connectivity of minimal counterexamples to Hadwiger's conjecture, J. Combin. Theory (B) 97 (2007), 144–150.Google Scholar
37. , Note on coloring graphs with no odd-Kk-minors, J. Combin. Theory (B) 99 (2009), 738–741.Google Scholar
38. , Minors in 7-chromatic graphs, preprint.
39. , and , On sufficient degree conditions for a graph to be k-linked, Combin. Probab. Comput. 15 (2006), 685–694.Google Scholar
40. and , A relaxed Hadwiger's conjecture for list-colorings, J. Combin. Theory (B) 97 (2007), 647–651.Google Scholar
41. , , and , K6 minors in large 6-connected graphs, submitted.
42. , and , Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture, J. Combin. Theory (B) 96 (2005), 152–167.Google Scholar
43. and , Fractional coloring and the odd Hadwiger's conjecture, Europ. J. Combin. 29 (2008), 411–417.Google Scholar
44. and , Hadwiger's conjecture is decidable, STOC'09 Proc. 2009 ACM International Symposium on Theory ofComputing, ACM (2009), 445–454.Google Scholar
45. and , Some remarks on the odd Hadwiger's conjecture, Combinatorica 27 (2007), 429–438.Google Scholar
46. and , Any 7-chromatic graph has K7 or K4, 4 as a minor, Combinatorica 25 (2005), 327–353.Google Scholar
47. and , Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's conjecture, J. Combin. Theory (B) 103 (2013), 320–326.Google Scholar
48. and , Topological cliques in graphs II, Combin. Prob. Comput. 5 (1996), 79–80.Google Scholar
49. , The minimum Hadwiger number for graphs with a given mean degree of vertices, Metody Diskret. Analiz 38 (1982), 37–58.Google Scholar
50. , Lower bound of the Hadwiger number of graphs by their average degree, Combinatorica 4 (1984), 307–316.Google Scholar
51. and , On a problem upon configurations contained in graphs with given chromatic number, Graph Theory in Memory ofG. A. Dirac (Sandbjerg, 1985), Ann. Discrete Math. 41, North-Holland (1989), 325–331.Google Scholar
52. , Homomorphiesatze fur Graphen, Math. Ann. 178 (1968), 154–168.Google Scholar
53. , Existenz n-fach zusammenhängender Teilgraphen in Graphen genilgend grosser Kantendichte, Abh. Math. Sem. Univ. Hamburg 37 (1972), 86–97.Google Scholar
54. , and , On a special case of Hadwiger's conjecture, Discuss. Math. Graph Theory 23 (2003), 333–363.Google Scholar
55. and , Fractional chromatic number and Hadwiger's conjecture, J. Combin. Theory (B) 74 (1998), 147–152.Google Scholar
56. , , and , The four-color theorem, J. Combin. Theory (B) 70 (1997), 2–44.Google Scholar
57. and , Graph minors XIII. The disjoint paths problem, J. Combin. Theory (B) 63 (1995), 65–110.Google Scholar
58. and , Graph minors XVII. Taming a vortex, J. Combin. Theory (B) 77 (1999), 162–210.Google Scholar
59. and , Graph minors XVI. Excluding a non-planar graph, J. Combin. Theory (B) 89 (2003), 43–76.Google Scholar
60. and , Graph minors XX. Wagner's conjecture, J. Combin. Theory (B) 92 (2004), 325–357.Google Scholar
61. and , Graph minors XXIII, Nash-Williams' immersion conjecture, J. Combin. Theory (B) 100 (2010), 181–205.Google Scholar
62. , and , Hadwiger's conjecture for K6-free graphs, Combinatorica 13 (1993), 279–361.Google Scholar
63. , Combinatorial Optimization: Polyhedra and Efficiency, Springer, 2003.Google Scholar
64. and , The extremal function for K9 minors, J. Combin. Theory (B) 96 (2006), 240–252.Google Scholar
65. and , An improved linear edge bound for graph linkages, Europ. J. Combin. 26 (2005), 309–324.Google Scholar
66. , An extremal function for contractions of graphs, Math. Proc. Cambridge Philos. Soc. 95 (1984), 261–265.Google Scholar
67. , The extremal function for complete minors, J. Combin. Theory (B) 81 (2001), 318–338.Google Scholar
68. , Graph decomposition with applications to subdivisions and path systems modulok, J. Graph Theory 7 (1983) 261–271.Google Scholar
69. , Parity, cycle space, and K4-subdivision in graphs, Surveys in Combin-atorics, 1999, London Math. Soc. Lecture Notes 267, Cambridge University Press (1999), 223–238.Google Scholar
70. , Totally odd K4-subdivisions in 4-chromatic graphs, Combinatorica 21 (2001), 417–443.Google Scholar
71. , Some remarks on Hajós' conjecture, J. Combin. Theory (B) 93 (2005), 95–105.Google Scholar
72. , Problem 11, Recent Advances in Graph Theory (ed. ), Academia Praha (1975), 543–544.
73. , A survey of Hadwiger's conjecture, Congr. Numer. 115 (1996), 249–283.Google Scholar
74. , Über eine Eigenschaft der ebenen Komplexe, Math. Ann. 114 (1937), 570–590.Google Scholar
75. , Beweis einer Abschwachung der Hadwiger-Vermutung, Math. Ann. 153 (1964), 139–141.Google Scholar
76. , Independent sets in graphs with an excluded clique minor, Discrete Math. Theor. Comput. Sci. 9 (2007), 171–175.Google Scholar
77. , Subcontraction-equivalence and Hadwiger's conjecture, J. Graph Theory 11 (1987), 197–204.Google Scholar
78. , Proof of Toft's conjecture: every graph containing no fully odd K4 is 3-colorable, J. Combin. Optim. 2 (1998), 117–188.Google Scholar

# Send book to Kindle

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

# Send book to Dropbox

To send content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to Dropbox.

Available formats
×

# Send book to Google Drive

To send content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to Google Drive.

Available formats
×