Extensions of Erdős's 1962 theorem on non-Hamiltonian graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908931335389184 |
|---|---|
| author | Liu, Xu Ning, Bo Wang, Tao |
| author_facet | Liu, Xu Ning, Bo Wang, Tao |
| contents | For a positive integer $k$, a graph property $\mathcal{H}$, and a graph parameter $\mathcal{P}$, let $\operatorname{ex}_{\mathcal{P}}(n, \mathcal{H}; δ\geq k)$ denote the maximum value of $\mathcal{P}$ over all $n$-vertex graphs with minimum degree at least $k$ that do not possess the property $\mathcal{H}$. The corresponding extremal families are denoted by $\operatorname{EX}_{\mathcal{P}}(n, \mathcal{H}; δ\geq k)$. For two disjoint graphs $H_1$ and $H_2$, let $H_1 \cup H_2$ denote their (disjoint) union, i.e., the graph with vertex set $V(H_1) \cup V(H_2)$ and edge set $E(H_1) \cup E(H_2)$; and let $H_1 \vee H_2$ denote their join.
In 1962, Erdő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 of Erdős's 1962 theorem on non-Hamiltonian graphs.
The first result gives a common generalization of the extremal theorem due to Erdős and its spectral analogs. As direct applications, we obtain complete solutions to open problems raised in the literature since 2016, thereby improving nearly all related prior results in this direction. Our proof technique differs somewhat from those in \cite{MR3539577,MR3556876}. We also prove an analog theorem for the Hamiltonian-connected property and obtain a result which extends the theorem of Füredi, Kostochka, and Luo \cite{MR3843180} on Hamilton cycles. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_01068 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Extensions of Erdős's 1962 theorem on non-Hamiltonian graphs Liu, Xu Ning, Bo Wang, Tao Combinatorics For a positive integer $k$, a graph property $\mathcal{H}$, and a graph parameter $\mathcal{P}$, let $\operatorname{ex}_{\mathcal{P}}(n, \mathcal{H}; δ\geq k)$ denote the maximum value of $\mathcal{P}$ over all $n$-vertex graphs with minimum degree at least $k$ that do not possess the property $\mathcal{H}$. The corresponding extremal families are denoted by $\operatorname{EX}_{\mathcal{P}}(n, \mathcal{H}; δ\geq k)$. For two disjoint graphs $H_1$ and $H_2$, let $H_1 \cup H_2$ denote their (disjoint) union, i.e., the graph with vertex set $V(H_1) \cup V(H_2)$ and edge set $E(H_1) \cup E(H_2)$; and let $H_1 \vee H_2$ denote their join. In 1962, Erdő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 of Erdős's 1962 theorem on non-Hamiltonian graphs. The first result gives a common generalization of the extremal theorem due to Erdős and its spectral analogs. As direct applications, we obtain complete solutions to open problems raised in the literature since 2016, thereby improving nearly all related prior results in this direction. Our proof technique differs somewhat from those in \cite{MR3539577,MR3556876}. We also prove an analog theorem for the Hamiltonian-connected property and obtain a result which extends the theorem of Füredi, Kostochka, and Luo \cite{MR3843180} on Hamilton cycles. |
| title | Extensions of Erdős's 1962 theorem on non-Hamiltonian graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2604.01068 |