Metraipolis › archive › dc_50b2dccda0a7
Spread Methods for Induced Cycles — arXiv:2609.06481
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.06481
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:48:35.738Z
- SHA-256 of the archived text
d748cf97cef5e58794ddcc83003a3746bc5c8b868ef60d5d9e635303923981ff- Stable URL of this page
https://metraipolis.com/documento/dc_50b2dccda0a7
How to cite
Spread Methods for Induced Cycles — arXiv:2609.06481 — arXiv (en), https://arxiv.org/abs/2609.06481 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_50b2dccda0a7 (Metraipolis archive dc_50b2dccda0a7, sha256 d748cf97cef5e58794ddcc83003a3746bc5c8b868ef60d5d9e635303923981ff)
BibTeX
@misc{dc50b2dccda0a7,
title = {Spread Methods for Induced Cycles — arXiv:2609.06481},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.06481},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_50b2dccda0a7; sha256 d748cf97cef5e58794ddcc83003a3746bc5c8b868ef60d5d9e635303923981ff},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06481. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We develop a spread-based approach to finding induced cycles and apply it to two problems. First, we resolve the odd-hole gadget conjecture of Bradač, Draganić and Sudakov by constructing an $e^{O(k)}$-edge graph whose every $k$-edge-colouring contains a monochromatic induced odd cycle of length $O(\log k)$. As a consequence, for every $k\ge2$ and every sufficiently large odd $n$, $$ \widehat R_{\mathrm{ind}}(C_n;k)=e^{\Theta(k)}n. $$ The proof uses spread probability weights together with hypergraph containers. Second, we prove that for every sufficiently large fixed $d$, with high probability the largest hole in the random $d$-regular graph $G_{n,d}$ has order $\Theta(n\log d/d)$, resolving a problem of Frieze. Although the two proofs use different mechanisms, both begin with a well-distributed auxiliary object and use it to control the extra edges that could destroy inducedness.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.06481 — 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-16T14:32:29.792Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).