Metraipolis › archive › dc_fb59735a4eb5
Thinning and sprinkling: from robust sampling to almost Hamiltonicity — arXiv:2609.30165
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30165
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:41:05.263Z
- SHA-256 of the archived text
36c4ab0efefbf99226c6ced17d67b5f580e1741a52705342ad7f45b587af3b07- Stable URL of this page
https://metraipolis.com/documento/dc_fb59735a4eb5
How to cite
Thinning and sprinkling: from robust sampling to almost Hamiltonicity — arXiv:2609.30165 — arXiv (en), https://arxiv.org/abs/2609.30165 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fb59735a4eb5 (Metraipolis archive dc_fb59735a4eb5, sha256 36c4ab0efefbf99226c6ced17d67b5f580e1741a52705342ad7f45b587af3b07)
BibTeX
@misc{dcfb59735a4eb5,
title = {Thinning and sprinkling: from robust sampling to almost Hamiltonicity — arXiv:2609.30165},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30165},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fb59735a4eb5; sha256 36c4ab0efefbf99226c6ced17d67b5f580e1741a52705342ad7f45b587af3b07},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30165. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We develop the thinning--sprinkling technique, a general method for proving robustness of graph properties under random vertex sampling. Using it, we show that random induced subgraphs of tough graphs, high-degree connected vertex-transitive graphs, and nearly regular sublinear expanders retain strong connectivity or expansion properties with very high probability. We also prove that every $k$-connected graph with $k=\omega(\log n)$ contains a spanning bipartite subgraph that is $\Omega(k)$-connected. Using these robustness results, we further develop a general framework for constructing almost Hamilton cycles from randomly sampled highly connected subgraphs. As a consequence, we show that tough graphs, connected vertex-transitive graphs and nearly regular expanders contain a cycle of length at least $(1-o(1))n$ whenever the toughness or degree is polylogarithmically large. This gives asymptotic solutions of longstanding conjectures of Chvátal and Lovász on Hamiltonicity of tough and vertex-transitive graphs. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.30165 — 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-08T06:02:10.094Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).