Metraipolis › archive › dc_093280b474a3
Generalized Duke's theorem for signed Graphs — arXiv:2609.27628
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.27628
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:00:44.161Z
- SHA-256 of the archived text
19eda66a84fe3e074e8a38bc89a801802c0d83c97598dbac27918fc86dee85b5- Stable URL of this page
https://metraipolis.com/documento/dc_093280b474a3
How to cite
Generalized Duke's theorem for signed Graphs — arXiv:2609.27628 — arXiv (en), https://arxiv.org/abs/2609.27628 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_093280b474a3 (Metraipolis archive dc_093280b474a3, sha256 19eda66a84fe3e074e8a38bc89a801802c0d83c97598dbac27918fc86dee85b5)
BibTeX
@misc{dc093280b474a3,
title = {Generalized Duke's theorem for signed Graphs — arXiv:2609.27628},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.27628},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_093280b474a3; sha256 19eda66a84fe3e074e8a38bc89a801802c0d83c97598dbac27918fc86dee85b5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.27628. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Duke's interpolation theorem states that the orientable genera of a connected graph form an integer interval, and Stahl established the corresponding result for nonorientable embeddings. In 1991, Širáň showed that this interpolation property fails for signed graph embeddings: the Euler-genus spectrum of a signed graph may contain gaps. He subsequently asked whether all such gaps must occur at the lower end of the spectrum. In this paper, we establish a characterization of the Euler-genus spectrum of a connected signed graph. We prove that, for each parity class, the Euler genera form a step-two interval. Moreover, whenever both parity classes are nonempty, their maximum elements differ by one. As an consequence, if two consecutive integers $k$ and $k+1$ belong to the Euler-genus spectrum, then every integer from $k$ to the maximum Euler-genus also belongs to the spectrum, thereby answering Širáň's question affirmatively. Our proof uses the pre-signed graph representation of signed embeddings together with ordered adjacent-exchange operations and a matching interpretation of face numbers. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-24 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.27628 — 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-08T12:00:26.562Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).