no. 16 · Tuesday 17 November 2026
Every 3-connected $\{K_{1,4},K_{1,4}+e\}$-free split graph of order at least 13 is Hamilton-connected
Abstract
A graph is split if its vertex set can be partitioned into a clique and an independent set. Let $K_{1,4}+e$ denote the graph obtained from $K_{1,4}$ by adding an edge between two leaves. Ryjáček et al. [J. Combin. Theory Ser. B 134 (2019), 239–263] conjectured that every $4$-connected graph with minimum degree at least 6 that contains neither $K_{1,4}$ nor $K_{1,4}+e$ as an induced subgraph is Hamiltonian. They proved the conclusion for $5$-connected graphs with the same minimum degree bound. We prove that every $3$-connected split graph of order at least 13 that contains neither of these induced subgraphs is Hamilton-connected. Together with Dirac's theorem, this proves the conjecture of Ryjáček et al. for split graphs.
- fields
- Combinatorics