Metraipolis › archive › dc_ada99ec6b646
Pósa-type resilience for Hamilton Berge cycles in random hypergraphs — arXiv:2611.08525
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.08525
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:43:44.500Z
- SHA-256 of the archived text
5b499218ff3375f6e4ec6c35be0539f5f90148f3bfef0f2ab54846a932f306fe- Stable URL of this page
https://metraipolis.com/documento/dc_ada99ec6b646
How to cite
Pósa-type resilience for Hamilton Berge cycles in random hypergraphs — arXiv:2611.08525 — arXiv (en), https://arxiv.org/abs/2611.08525 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ada99ec6b646 (Metraipolis archive dc_ada99ec6b646, sha256 5b499218ff3375f6e4ec6c35be0539f5f90148f3bfef0f2ab54846a932f306fe)
BibTeX
@misc{dcada99ec6b646,
title = {Pósa-type resilience for Hamilton Berge cycles in random hypergraphs — arXiv:2611.08525},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.08525},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ada99ec6b646; sha256 5b499218ff3375f6e4ec6c35be0539f5f90148f3bfef0f2ab54846a932f306fe},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08525. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove a degree-sequence resilience theorem for Hamilton Berge cycles in random uniform hypergraphs. For every fixed integer $k\ge3$ and every $\gamma>0$, there exists $C=C(k,\gamma)>0$ such that if $C\log n/n^{k-1}\le p\le1$, then asymptotically almost surely every spanning subhypergraph of $H^{(k)}(n,p)$ with increasing vertex-degree sequence $g_1\le\cdots\le g_n$ satisfying \[ g_i\ge\left(\left(\frac{i}{n}\right)^{k-1}+\gamma\right) \binom{n-1}{k-1}p \qquad(1\le i<n/2) \] contains a Hamilton Berge cycle. The term $(i/n)^{k-1}$ agrees with the normalized asymptotic degree bound in Salia's deterministic Pósa-type theorem. Our result gives a hypergraph analogue of the random-graph theorem of Condon et al. and strengthens the sharp Dirac-type resilience theorem of Chen and Zhang at the same logarithmic probability order. The deletion-resilience formulation has optimal probability order up to constant factors. The coefficient $1$ of $(i/n)^{k-1}$ cannot be replaced by a smaller constant. The proof controls adaptive rotations and representative-edge incidences uniformly. It also gives an endpoint-growth estimate under nonuniform deletion bounds.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.08525 — 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-11-09T22:36:32.126Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).