Metraipolis › archive › dc_2f331379da5f

Local Resilience for Containment of Bounded Degree Spanning Subgraphs — arXiv:2609.14834

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.14834
License (as archived)
CC0-1.0
Archived
2026-10-16T01:25:23.756Z
SHA-256 of the archived text
8b71e397ad646b76512700836a5fd0333a061d12a6cc2a96852d4ea6d1f5074e
Stable URL of this page
https://metraipolis.com/documento/dc_2f331379da5f

How to cite

Local Resilience for Containment of Bounded Degree Spanning Subgraphs — arXiv:2609.14834 — arXiv (en), https://arxiv.org/abs/2609.14834 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2f331379da5f (Metraipolis archive dc_2f331379da5f, sha256 8b71e397ad646b76512700836a5fd0333a061d12a6cc2a96852d4ea6d1f5074e)
BibTeX
@misc{dc2f331379da5f,
  title = {Local Resilience for Containment of Bounded Degree Spanning Subgraphs — arXiv:2609.14834},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14834},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2f331379da5f; sha256 8b71e397ad646b76512700836a5fd0333a061d12a6cc2a96852d4ea6d1f5074e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14834. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove that for all $\Delta \geq 2$ and $\gamma > 0$, there exists a constant $C = C(\Delta, \gamma)$ such that for $p\geq C(\log n/n)^{1/\Delta}$, asymptotically almost surely, every spanning subgraph $G$ of $G(n,p)$ with minimum degree at least $(1-1/(2\Delta)+\gamma)pn$ contains every $n$-vertex graph $H$ with maximum degree at most $\Delta$ and with at least $Cp^{-2}$ vertices not in any triangles of $H$. This is a 'sparse local resilience version' of a classical theorem of Sauer and Spencer. The condition that $H$ should contain some vertices not in triangles is necessary, and in fact, the quantity $p^{-2}$ is asymptotically best possible. A key feature of our result is that $H$ is allowed to be an expander graph, distinguishing it from previous results of similar nature, which dealt with, e.g., graphs of sublinear bandwidth. Our proof makes use of regularity arguments, with the sparse blow-up lemma for random graphs being a key tool.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.14834 — 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-16T00:39:30.226Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).