Every 3-connected K 1,4,K 1,4+e-free split graph of order at least 13 is Hamilton-connected
math.CO
Submitted: 2026-03-13
Updated: 2026-11-15
Terminology
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality