Extensions of Erd\H{o}s's 1962 theorem on non-Hamiltonian graphs
Xu Liu, Bo Ning, and Tao Wang

TL;DR
This paper extends Erdős's 1962 theorem on non-Hamiltonian graphs, providing generalized extremal results, solving open problems, and introducing new proof techniques for related graph properties.
Contribution
It offers a unified generalization of Erdős's theorem and spectral analogs, solving several open problems and extending results on Hamiltonian properties.
Findings
Generalized Erdős's theorem for non-Hamiltonian graphs.
Solved open problems from 2016 related to extremal graph properties.
Extended results to Hamiltonian-connected graphs and Hamilton cycles.
Abstract
For a positive integer , a graph property , and a graph parameter , let denote the maximum value of over all -vertex graphs with minimum degree at least that do not possess the property . The corresponding extremal families are denoted by . For two disjoint graphs and , let denote their (disjoint) union, i.e., the graph with vertex set and edge set ; and let denote their join. In 1962, Erd\H{o}s established a classical theorem on the maximum number of edges in a non-Hamiltonian graph of given order and minimum degree. Motivated by recent work on feasible graph parameters in \cite{Ai2023}, we prove several extensions…
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.
