Metraipolis › archive › dc_7b5032aec659
Layer barriers for colour-biased tight Hamilton cycles — arXiv:2608.12013
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.12013
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T05:47:46.910Z
- SHA-256 of the archived text
08795b55fec4bed63d7fe4f7e7069fab25dca35c19a07dac82639b9b332fd53a- Stable URL of this page
https://metraipolis.com/documento/dc_7b5032aec659
How to cite
Layer barriers for colour-biased tight Hamilton cycles — arXiv:2608.12013 — arXiv (en), https://arxiv.org/abs/2608.12013 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7b5032aec659 (Metraipolis archive dc_7b5032aec659, sha256 08795b55fec4bed63d7fe4f7e7069fab25dca35c19a07dac82639b9b332fd53a)
BibTeX
@misc{dc7b5032aec659,
title = {Layer barriers for colour-biased tight Hamilton cycles — arXiv:2608.12013},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.12013},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7b5032aec659; sha256 08795b55fec4bed63d7fe4f7e7069fab25dca35c19a07dac82639b9b332fd53a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12013. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We construct a family of layer barriers for colour-biased tight Hamilton cycles in uniform hypergraphs. For every $k\ge 3$ and every $a\in\{0,\ldots,k-1\}$, we give a red--blue coloured $k$-graph that contains a tight Hamilton cycle, while every tight Hamilton cycle in the construction is perfectly colour-balanced. The construction underlying the higher-uniformity threshold conjectured by Behague, Clemen, Hyde and Morrison corresponds to the boundary case $a=0$ of this family. We show that interior choices of $a$ can yield strictly denser barriers. In particular, for $k=17$ and $a=8$, the asymptotic relative minimum vertex degree of our construction is \[ \frac{5761}{8192}\approx 0.703247, \] which exceeds the conjectured value $d_{17}\approx 0.699277$. This provides a counterexample to the proposed higher-uniformity threshold in Conjecture~6.1 of Behague, Clemen, Hyde and Morrison. Moreover, by choosing the layer appropriately as $k\to\infty$, the family contains barriers whose asymptotic relative minimum vertex degree is \[ 1-O\bigl(k^{-1/2}\bigr). \] Thus the interior members of the layer-barrier family exhibit substantially different behaviour from the previously considered boundary construction in large uniformity.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-13 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.12013 — 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-19T05:40:33.659Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).