Any 7-Chromatic Graphs Has K7 Or K4,4 As A Minor
- Cite this article as:
- Kawarabayashi*, Ki. & Toft†, B. Combinatorica (2005) 25: 327. doi:10.1007/s00493-005-0019-1
- 129 Downloads
In 1943, Hadwiger made the conjecture that every k-chromatic graph has a Kk-minor. This conjecture is, perhaps, the most interesting conjecture of all graph theory. It is well known that the case k=5 is equivalent to the Four Colour Theorem, as proved by Wagner  in 1937. About 60 years later, Robertson, Seymour and Thomas  proved that the case k=6 is also equivalent to the Four Colour Theorem. So far, the cases k≥7 are still open and we have little hope to verify even the case k=7 up to now. In fact, there are only a few theorems concerning 7-chromatic graphs, e. g. .
In this paper, we prove the deep result stated in the title, without using the Four Colour Theorem [1,2,28]. This result verifies the first unsettled case m=6 of the (m,1)-Minor Conjecture which is a weaker form of Hadwiger’s Conjecture and a special case of a more general conjecture of Chartrand et al.  in 1971 and Woodall  in 1990.
The proof is somewhat long and uses earlier deep results and methods of Jørgensen , Mader , and Robertson, Seymour and Thomas .