Metraipolis › archive › dc_3fa86c94ec89
Nearly Spanning Regular Subgraphs — arXiv:2609.19777
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19777
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T04:47:07.006Z
- SHA-256 of the archived text
ce48829d6ed8ab016e534953fb34e06a9c6b816ae0fb7060fa2b81697b68b95d- Stable URL of this page
https://metraipolis.com/documento/dc_3fa86c94ec89
How to cite
Nearly Spanning Regular Subgraphs — arXiv:2609.19777 — arXiv (en), https://arxiv.org/abs/2609.19777 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3fa86c94ec89 (Metraipolis archive dc_3fa86c94ec89, sha256 ce48829d6ed8ab016e534953fb34e06a9c6b816ae0fb7060fa2b81697b68b95d)
BibTeX
@misc{dc3fa86c94ec89,
title = {Nearly Spanning Regular Subgraphs — arXiv:2609.19777},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19777},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3fa86c94ec89; sha256 ce48829d6ed8ab016e534953fb34e06a9c6b816ae0fb7060fa2b81697b68b95d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19777. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Alon and Mubayi asked whether, for every integer $k\ge1$ and every $\varepsilon>0$, there exists $r_0=r_0(k,\varepsilon)$ such that every $r$-regular graph on $n$ vertices with $r\ge r_0$ contains a $k$-regular subgraph covering at least $(1-\varepsilon)n$ vertices. Previously, the conjecture was known for $k\in\{1,2\}$ and for $k$ and $r$ both even. We answer this question affirmatively for general $k$ and $r$ with $\varepsilon=O_k(r^{-1/2})$. For $k=2$ and every odd $r\ge3$, we show that $\varepsilon=1/(r^2-3)$ suffices which is best possible.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.19777 — 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-10T04:15:33.128Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).