Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2603.28202 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Table des matières:
- We prove that every $3$-graph $H$ on $n$ vertices with minimum codegree $δ_2(H) \geq 7n/9 + o(n)$ contains the square of a tight Hamilton cycle. This strengthens a theorem of Bedenknecht and Reiher that $δ_2(H) \geq 4n/5 + o(n)$ is sufficient. The central novelty of our arguments is an improved understanding of the connectivity structure of $3$-graphs with large minimum codegree.