Metraipolis › archive › dc_c96e8ddf42e6
Two-point concentration for graph classes admitting sparse vertex deletion — arXiv:2611.00437
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00437
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:34:46.475Z
- SHA-256 of the archived text
e2817efcd12aecdc823e97ce36b0570d78cd5f59fcfa9378af4136583ebe4918- Stable URL of this page
https://metraipolis.com/documento/dc_c96e8ddf42e6
How to cite
Two-point concentration for graph classes admitting sparse vertex deletion — arXiv:2611.00437 — arXiv (en), https://arxiv.org/abs/2611.00437 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c96e8ddf42e6 (Metraipolis archive dc_c96e8ddf42e6, sha256 e2817efcd12aecdc823e97ce36b0570d78cd5f59fcfa9378af4136583ebe4918)
BibTeX
@misc{dcc96e8ddf42e6,
title = {Two-point concentration for graph classes admitting sparse vertex deletion — arXiv:2611.00437},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00437},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c96e8ddf42e6; sha256 e2817efcd12aecdc823e97ce36b0570d78cd5f59fcfa9378af4136583ebe4918},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00437. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For fixed $p\in(0,1)$, we prove that the maximum number of vertices in an induced subgraph of $G(n,p)$ from a given class is concentrated on two consecutive integers, unifying and extending several earlier results. We require that the class contain arbitrarily large graphs and that every sufficiently large $k$-vertex member have a vertex of degree $o(k)$ whose deletion leaves a graph in the same class. This condition holds for empty graphs, trees, forests, planar graphs, graphs of bounded maximum degree, degeneracy or treewidth, graphs excluding a fixed complete bipartite subgraph (including graphs containing no cycle of length four), and many other graph classes. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO) ; Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2611.00437 — 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-11-03T11:04:52.288Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).