Properties of $8$-contraction-critical graphs with no $K_7$ minor
Martin Rolek, Zi-Xia Song, Robin Thomas

TL;DR
This paper investigates properties of 8-contraction-critical graphs lacking a K7 minor, showing such graphs have at most one vertex of degree 8, contributing to the broader goal of proving K7-minor-free graphs are 7-colorable.
Contribution
It establishes a structural property of 8-contraction-critical graphs without K7 minors, advancing the understanding towards Hadwiger's conjecture for K7.
Findings
Such graphs have at most one vertex of degree 8.
The result supports the conjecture that K7-minor-free graphs are 7-colorable.
Abstract
Motivated by the famous Hadwiger's Conjecture, we study the properties of -contraction-critical graphs with no minor; we prove that every -contraction-critical graph with no minor has at most one vertex of degree , where a graph is -contraction-critical if is not -colorable but every proper minor of is -colorable. This is one step in our effort to prove that every graph with no minor is -colorable, which remains open.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems
