The Genus of Bipartite Kneser Graphs
arXiv:2610.03159
Abstract
We determine the orientable genus of an infinite family of bipartite Kneser graphs. The graph has two copies of the two-element subsets of , with opposite-class vertices adjacent when the corresponding subsets are disjoint. For every prime with , we prove 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.