3 papers
math.CO2026
The Genus of Bipartite Kneser Graphs
Austin Ulrigg, Alexander Metzger
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 verti…
math.CO2026
On the Genus Polynomial of Cubic Graphs
Austin Ulrigg
The orientable genus polynomial of a graph counts its cellular embeddings by genus. For finite simple -connected cubic graphs it is a cycle-matroid invariant: i…
cs.DM2024
An Efficient Genus Algorithm Based on Graph Rotations
Alexander Metzger, Austin Ulrigg
We study the problem of determining the minimal genus of a simple finite connected graph. We present an algorithm which, for an arbitrary graph with vertices and edges,…