Metraipolis › archive › dc_7fb16ba9bddb
Counting almost independent sets in regular graphs — arXiv:2609.28527
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.28527
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:36:37.254Z
- SHA-256 of the archived text
0eb3342d4fca59bb84559a2dc988d36e4abd1089ff0785c3008b694f6104ccac- Stable URL of this page
https://metraipolis.com/documento/dc_7fb16ba9bddb
How to cite
Counting almost independent sets in regular graphs — arXiv:2609.28527 — arXiv (en), https://arxiv.org/abs/2609.28527 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7fb16ba9bddb (Metraipolis archive dc_7fb16ba9bddb, sha256 0eb3342d4fca59bb84559a2dc988d36e4abd1089ff0785c3008b694f6104ccac)
BibTeX
@misc{dc7fb16ba9bddb,
title = {Counting almost independent sets in regular graphs — arXiv:2609.28527},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.28527},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7fb16ba9bddb; sha256 0eb3342d4fca59bb84559a2dc988d36e4abd1089ff0785c3008b694f6104ccac},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.28527. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Kahn proved that, among bipartite $d$-regular graphs on $n$ vertices, the number of independent sets is maximized by a disjoint union of copies of $K_{d,d}$. Zhao later extended this result to all $d$-regular graphs. We prove a robust version of this theorem in which independent sets are replaced by sets spanning few internal edges. If $G$ is $d$-regular on $n$ vertices, then the number of subsets spanning at most $\gamma dn$ edges is at most $$ 2^{n/2}\exp\left\{ O\bigl(\gamma\log(e/\gamma)n\bigr) + O\bigl(n/d\bigr) \right\}. $$ Both correction terms are sharp up to absolute constants: the $\gamma\log(1/\gamma)n$ term is necessary when $d$ is sufficiently large in terms of $\gamma$, while the $n/d$ term is already necessary for independent sets. Our result answers a question of Seth.
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.28527 — 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:09.993Z 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).