An Ore-type theorem for $[3]$-graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915291693318144 |
|---|---|
| author | Li, Yupei Lu, Linyuan Luo, Ruth |
| author_facet | Li, Yupei Lu, Linyuan Luo, Ruth |
| contents | Ore's Theorem states that if $G$ is an $n$-vertex graph and every pair of non-adjacent vertices has degree sum at least $n$, then $G$ is Hamiltonian.
A $[3]$-graph is a hypergraph in which every edge contains at most $3$ vertices. In this paper, we prove an Ore-type result on the existence of Hamiltonian Berge cycles in $[3]$-graph $\cH$, based on the degree sum of every pair of non-adjacent vertices in the $2$-shadow graph $\partial \cH$ of $\cH$. Namely, we prove that there exists a constant $d_0$ such that for all $n \geq 6$, if a $[3]$-graph $\cH$ on $n$ vertices satisfies that every pair $u,v \in V(\cH)$ of non-adjacent vertices has degree sum $d_{\partial \cH}(u) + d_{\partial \cH}(v) \geq n+d_0$, then $\cH$ contains a Hamiltonian Berge cycle. Moreover, we conjecture that $d_0=1$ suffices. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_12035 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An Ore-type theorem for $[3]$-graphs Li, Yupei Lu, Linyuan Luo, Ruth Combinatorics Ore's Theorem states that if $G$ is an $n$-vertex graph and every pair of non-adjacent vertices has degree sum at least $n$, then $G$ is Hamiltonian. A $[3]$-graph is a hypergraph in which every edge contains at most $3$ vertices. In this paper, we prove an Ore-type result on the existence of Hamiltonian Berge cycles in $[3]$-graph $\cH$, based on the degree sum of every pair of non-adjacent vertices in the $2$-shadow graph $\partial \cH$ of $\cH$. Namely, we prove that there exists a constant $d_0$ such that for all $n \geq 6$, if a $[3]$-graph $\cH$ on $n$ vertices satisfies that every pair $u,v \in V(\cH)$ of non-adjacent vertices has degree sum $d_{\partial \cH}(u) + d_{\partial \cH}(v) \geq n+d_0$, then $\cH$ contains a Hamiltonian Berge cycle. Moreover, we conjecture that $d_0=1$ suffices. |
| title | An Ore-type theorem for $[3]$-graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2505.12035 |