Metraipolis › archive › dc_016d7729aaa8
Self-complementary completions on six vertices — arXiv:2609.20231
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.20231
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T03:24:11.392Z
- SHA-256 of the archived text
dbf801ae1ff0e00a6d829f25ca0015019056c0b8c47c23d0fb5b00bfa318a12d- Stable URL of this page
https://metraipolis.com/documento/dc_016d7729aaa8
How to cite
Self-complementary completions on six vertices — arXiv:2609.20231 — arXiv (en), https://arxiv.org/abs/2609.20231 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_016d7729aaa8 (Metraipolis archive dc_016d7729aaa8, sha256 dbf801ae1ff0e00a6d829f25ca0015019056c0b8c47c23d0fb5b00bfa318a12d)
BibTeX
@misc{dc016d7729aaa8,
title = {Self-complementary completions on six vertices — arXiv:2609.20231},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.20231},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_016d7729aaa8; sha256 dbf801ae1ff0e00a6d829f25ca0015019056c0b8c47c23d0fb5b00bfa318a12d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20231. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let \(\cthreshold(n)\) be the largest integer \(q\) such that every loopless digraph on \(n\) vertices with at most \(q\) arcs is isomorphic to a spanning subdigraph of a self-complementary digraph of order \(n\). We prove that \(\cthreshold(6)=7\). The upper bound is witnessed by \[ \bK{3}\dunion (x\longrightarrow y\longrightarrow z), \] and follows from a direct argument with a self-complementing permutation. We also determine the complete eight-arc obstruction layer: it consists of five isomorphism classes, or three after converse digraphs are identified. All five are arc-minimal. Each nevertheless packs with an isomorphic copy of itself, so ordinary packing is strictly weaker than same-order self-complementary completion already at this first failure layer.
Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-18 in cs.AI).
Categorie arXiv: Combinatorics (math.CO) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2609.20231 — 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-10T03:04:13.929Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).