Every 3-connected -free split graph of order at least 13 is Hamilton-connected
arXiv:2603.12770
Abstract
A graph is split if its vertex set can be partitioned into a clique and an independent set. Let denote the graph obtained from by adding an edge between two leaves. Ryjáček et al. [J. Combin. Theory Ser. B 134 (2019), 239--263] conjectured that every -connected graph with minimum degree at least 6 that contains neither nor as an induced subgraph is Hamiltonian. They proved the conclusion for -connected graphs with the same minimum degree bound. We prove that every -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.