Metraipolis › archive › dc_fe1d5f39bf8d

A stability theorem for Berge Hamiltonian cycles under a minimum degree condition — arXiv:2608.04603

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.04603
License (as archived)
CC0-1.0
Archived
2026-10-31T11:46:01.688Z
SHA-256 of the archived text
a0f03a650049f1ce6c32ad2307fbf0aee8a6923d5e76901f82bccc8e4bc02aa2
Stable URL of this page
https://metraipolis.com/documento/dc_fe1d5f39bf8d

How to cite

A stability theorem for Berge Hamiltonian cycles under a minimum degree condition — arXiv:2608.04603 — arXiv (en), https://arxiv.org/abs/2608.04603 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fe1d5f39bf8d (Metraipolis archive dc_fe1d5f39bf8d, sha256 a0f03a650049f1ce6c32ad2307fbf0aee8a6923d5e76901f82bccc8e4bc02aa2)
BibTeX
@misc{dcfe1d5f39bf8d,
  title = {A stability theorem for Berge Hamiltonian cycles under a minimum degree condition — arXiv:2608.04603},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.04603},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fe1d5f39bf8d; sha256 a0f03a650049f1ce6c32ad2307fbf0aee8a6923d5e76901f82bccc8e4bc02aa2},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04603. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In this paper, we study extremal and stability problems for Berge Hamiltonian cycles in $r$-uniform hypergraphs under a minimum degree condition. Let $ g_r(n,t)=\binom{n-t}{r}+t\binom{t}{r-1}$, and let $t=t(k)$ be the unique integer satisfying $\binom{t-1}{r-1}<k\le \binom{t}{r-1}$. Using a sharp Pósa-type degree sequence theorem of Salia, we prove an extremal upper bound on the number of hyperedges in an $n$-vertex $r$-uniform hypergraph with minimum degree at least $k$ and with no Berge Hamiltonian cycle. We also prove a stability theorem in the dense range before the first minimizer of $g_r(n,t)$: every near-extremal example is contained in one of two natural non-Hamiltonian constructions.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-06 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.04603 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T11:35:10.104Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).