Metraipolis › archive › dc_c2aa3683237c

There are no nontrivial uniquely C_9-saturated graphs — arXiv:2609.33035

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.33035
License (as archived)
CC0-1.0
Archived
2026-10-07T23:28:57.449Z
SHA-256 of the archived text
c1a30809f199bddc5e5dbfc419c3a6ad4f987a2dde375880dc812c7be2e3d8ea
Stable URL of this page
https://metraipolis.com/documento/dc_c2aa3683237c

How to cite

There are no nontrivial uniquely C_9-saturated graphs — arXiv:2609.33035 — arXiv (en), https://arxiv.org/abs/2609.33035 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c2aa3683237c (Metraipolis archive dc_c2aa3683237c, sha256 c1a30809f199bddc5e5dbfc419c3a6ad4f987a2dde375880dc812c7be2e3d8ea)
BibTeX
@misc{dcc2aa3683237c,
  title = {There are no nontrivial uniquely C_9-saturated graphs — arXiv:2609.33035},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.33035},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c2aa3683237c; sha256 c1a30809f199bddc5e5dbfc419c3a6ad4f987a2dde375880dc812c7be2e3d8ea},
  year = {2026}
}

Archived text

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

A graph G is uniquely C_t-saturated if G contains no cycle of length t and, for every edge e of the complement, G+e contains exactly one cycle of length t; it is nontrivial if it has at least t vertices. Wenger and West proved that no nontrivial uniquely C_6- or C_7-saturated graphs exist, and conjectured the same for every t >= 6; the case t=8 was verified but never published, and t >= 9 has remained open. We prove the conjecture for t=9: there is no nontrivial uniquely C_9-saturated graph. The proof is a case analysis on the length L of a longest even cycle of length at most 12 (L is 4, 6, 8, 10, or 12). The cases L=12, L=10, and L=4 are settled by hand; for L=6 and L=8, hand classifications of the components outside the cycle reduce each case to a bounded finite family of configurations, eliminated by a short, replayable computer enumeration with known-answer controls and completeness certified by zero cap hits. Along the way we prove, in sharpened form, the t=9 instance of a structural lemma Wenger and West stated without proof.

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