Metraipolis › archive › dc_caa9fc3babf4
The Genus of Bipartite Kneser Graphs — arXiv:2610.03159
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.03159
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T08:25:05.662Z
- SHA-256 of the archived text
7aafbfe8eb9d5341786f42fae53f8a715ddc0eb3b7280455418451518c756efa- Stable URL of this page
https://metraipolis.com/documento/dc_caa9fc3babf4
How to cite
The Genus of Bipartite Kneser Graphs — arXiv:2610.03159 — arXiv (en), https://arxiv.org/abs/2610.03159 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_caa9fc3babf4 (Metraipolis archive dc_caa9fc3babf4, sha256 7aafbfe8eb9d5341786f42fae53f8a715ddc0eb3b7280455418451518c756efa)
BibTeX
@misc{dccaa9fc3babf4,
title = {The Genus of Bipartite Kneser Graphs — arXiv:2610.03159},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.03159},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_caa9fc3babf4; sha256 7aafbfe8eb9d5341786f42fae53f8a715ddc0eb3b7280455418451518c756efa},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.03159. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We determine the orientable genus of an infinite family of bipartite Kneser graphs. The graph $H(h,2)$ has two copies of the two-element subsets of $[h]$, with opposite-class vertices adjacent when the corresponding subsets are disjoint. For every prime $h>3$ with $h\equiv3\pmod8$, we prove $$ \gamma(H(h,2))=1-\frac{h(h-1)}{2} +\frac{h(h-1)(h-2)(h-3)}{16}. $$ Euler's formula gives this lower bound, with equality for a quadrangulation. We construct a vertex-transitive orientable quadrangulation using an odd-order affine group that acts simply transitively on the two-element subsets. This gives an infinite family satisfying Pisanski's conjecture on quadrilateral embeddings of regular bipartite graphs.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-05 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.03159 — 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-06T08:18:48.304Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).