On minors of non-hamiltonian graphs
Combinatorics
2025-06-26 v1
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.
Cite
@article{arxiv.2506.20087,
title = {On minors of non-hamiltonian graphs},
author = {On-Hei Solomon Lo},
journal= {arXiv preprint arXiv:2506.20087},
year = {2025}
}