Metraipolis › archive › dc_24f71bee7ff5
Finite deletion-induced saturation for every non-complete graph — arXiv:2609.21388
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.21388
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T02:10:26.565Z
- SHA-256 of the archived text
3f71660a6fec0275a4bd3187c7bf79a1c69d0a820492b5c770a14cc8113bf6e0- Stable URL of this page
https://metraipolis.com/documento/dc_24f71bee7ff5
How to cite
Finite deletion-induced saturation for every non-complete graph — arXiv:2609.21388 — arXiv (en), https://arxiv.org/abs/2609.21388 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_24f71bee7ff5 (Metraipolis archive dc_24f71bee7ff5, sha256 3f71660a6fec0275a4bd3187c7bf79a1c69d0a820492b5c770a14cc8113bf6e0)
BibTeX
@misc{dc24f71bee7ff5,
title = {Finite deletion-induced saturation for every non-complete graph — arXiv:2609.21388},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.21388},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_24f71bee7ff5; sha256 3f71660a6fec0275a4bd3187c7bf79a1c69d0a820492b5c770a14cc8113bf6e0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21388. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A graph $G$ is deletion-induced-saturated for $H$ if $G$ has an edge, contains no induced copy of $H$, and deleting any edge of $G$ creates an induced copy of $H$. We prove, with finite certificate verification, that a finite graph $H$ admits such a finite graph $G$ if and only if $H$ is not complete. This resolves the deletion conjecture of Fan, Hajebi, Hajebi and Spirkl. The main step transfers suitable free amalgamations to finite extensions using a local lifting theorem of Auinger, Bitterlich and Otto. A second criterion treats edge addition by protecting specified nonedges and then taking a maximal induced-$H$-free completion. Structural results of Bonamy, Groenland, Johnston, Morrison and Scott reduce the remaining targets to dense templates and a finite hereditary class. Two uniform constructions in halved cubes handle the dense templates. The finite part is supported by exhaustive coverage certificates, structural certificates and explicit hosts, including a circulant graph on $30$ vertices. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.21388 — 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-10T01:48:20.591Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).