On minors of non-hamiltonian graphs
On-Hei Solomon Lo

TL;DR
This paper proves that 4-connected non-hamiltonian graphs must contain a K_{3,4} minor, strengthening Tutte's theorem, and confirms a conjecture regarding minors in 3-connected non-hamiltonian graphs, advancing graph minor theory.
Contribution
It establishes that 4-connected non-hamiltonian graphs contain K_{3,4} as a minor and confirms a conjecture about minors in 3-connected non-hamiltonian graphs, strengthening existing theories.
Findings
4-connected non-hamiltonian graphs contain K_{3,4} as a minor
Confirmed a conjecture about minors in 3-connected non-hamiltonian graphs
Strengthened the understanding of graph minors in non-hamiltonian graphs
Abstract
A theorem of Tutte states that every 4-connected non-hamiltonian graph contains as a minor. We strengthen this result by proving that such a graph must contain as a minor, thereby confirming a special case of a conjecture posed by Chen, Yu, and Zang in a strong form. This result may be viewed as a step toward characterizing the minor-minimal 4-connected non-hamiltonian graphs. As a 3-connected analog, Ding and Marshall conjectured that every 3-connected non-hamiltonian graph has a minor of , , or the Herschel graph, where is obtained from the cube by adding a new vertex adjacent to three independent vertices. We confirm this conjecture.
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
TopicsGraph theory and applications · Advanced Graph Theory Research · Graph Labeling and Dimension Problems
