Complete and almost complete minors in double-critical 8-chromatic graphs

Details Complete and almost complete minors in double-critical 8-chromatic graphs Complete and almost complete minors in double-critical 8-chromatic graphs

2010-07-30

arxiv.org/abs/1007.5400v1

Mathematics

Combinatorics

Scientific paper

A connected $k$-chromatic graph $G$ is said to be {\it double-critical} if for all edges $uv$ of $G$ the graph $G - u - v$ is $(k-2)$-colourable. A longstanding conjecture of Erd\H{o}s and Lov\'asz states that the complete graphs are the only double-critical graphs. Kawarabayashi, Pedersen and Toft [\it{Electron. J. Combin.}, 17(1): Research Paper 87, 2010] proved that every double-critical $k$-chromatic graph with $k \leq 7$ contains a $K_k$ minor. It remains unknown whether an arbitrary double-critical $8$-chromatic graph contains a $K_8$ minor, but in this paper we prove that any double-critical $8$-chromatic contains a $K_8^-$ minor; here $K_8^-$ denotes the complete $8$-graph with one edge missing. In addition, we observe that any double-critical $8$-chromatic graph with minimum degree different from $10$ and $11$ contains a $K_8$ minor.

Affiliated with

Also associated with

No associations

Rating

Complete and almost complete minors in double-critical 8-chromatic graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complete and almost complete minors in double-critical 8-chromatic graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complete and almost complete minors in double-critical 8-chromatic graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-700505