A connected $t$-chromatic graph $G$ is \dfn{double-critical} if $G \backslash\{u, v\}$ is $(t-2)$-colorable for each edge $uv\in E(G)$. A long standing conjecture of Erd\H{o}s and Lov\'asz that the complete graphs are the only double-critical $t$-chromatic graphs remains open for all $t\ge6$. Given the difficulty in settling Erd\H{o}s and Lov\'asz's conjecture and motivated by the well-known Hadwiger's conjecture, Kawarabayashi, Pedersen and Toft proposed a weaker conjecture that every double-critical $t$-chromatic graph contains a $K_t$ minor and verified their conjecture for $t\le7$. A computer-assisted proof of their conjecture for $t=8$ was recently announced by Albar and Gon\c{c}alves. In this paper we give a much shorter and computer-free proof of their conjecture for $t\le8$ and prove the next step by showing that every double-critical $t$-chromatic graph contains a $K_9$ minor for all $t\ge9$.
[1]
G. Dirac.
Homomorphism theorems for graphs
,
1964
.
[2]
Boris Albar,et al.
On triangles in K_r-minor free graphs
,
2013,
1304.5468.
[3]
Leif K. Jørgensen,et al.
Contractions to k8
,
1994,
J. Graph Theory.
[4]
Robin Thomas,et al.
The extremal function for K9 minors
,
2006,
J. Comb. Theory, Ser. B.
[5]
Daniel Gonçalves,et al.
On triangles in Kr ‐minor free graphs
,
2018,
J. Graph Theory.
[6]
W. Mader.
Homomorphiesätze für Graphen
,
1968
.
[7]
J. Rodriguez,et al.
Problem (2)
,
1994
.
[8]
Ken-ichi Kawarabayashi,et al.
Double-Critical Graphs and Complete Minors
,
2008,
Electron. J. Comb..
[9]
Michael Stiebitz.
K5 is the only double-critical 5-chromatic graph
,
1987,
Discret. Math..