Searcharxiv⌕ Search

arXiv subjects

Austin Ulrigg

Publications and source records attributed to Austin Ulrigg.

5 recordsLinked to original sources

Toroidal Obstructions with No K_5 Minor

Finding the complete set of forbidden minors for the torus remains an open problem. We determine the complete list of toroidal minor obstructions with no $K_5$ minor and prove that there are exactly $74$, each with between $10$ and $14$ vertices. Combined with the known classification of toroidal obstructions with no $K_{3,3}$ minor, this determines every toroidal obstruction that excludes one of the forbidden minors for planarity. The proof uses three-vertex cuts to show that, apart from $K_{3,7}$, every three-connected obstruction in this class has two distinct independent triples, each the common neighborhood of at least two degree-three vertices. The classification proceeds by considering the possible intersections of these triples and reduces each case by planarity tests and enumeration of the possible graph forms. From the $74$ minor obstructions we also obtain a complete list of $381$ topological obstructions for the torus with no $K_5$ minor.

math.CO↗

Resolving Pisanski's Conjecture

We prove Pisanski's conjecture on quadrilateral embeddings of regular bipartite graphs. For integers $m\geq d\geq4$ with $4\mid md$, we construct both a connected simple $d$-regular bipartite graph $G$ with $m$ vertices in each bipartition class and an orientable quadrangulation. This graph's genus is \[ \ga(G)=1+\frac{m(d-4)}4. \] These quadrangulations attain the lower bound on the genus from Euler's formula. We give dihedral constructions for even $m$ and a cyclic construction for every $m\geq d$ with $4\mid d$. In each case, two cyclic permutations of a connection set of size $d$ determine all of the local rotations.

math.CO↗

The Genus of Bipartite Kneser Graphs

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 $$ γ(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.

math.CO↗

On the Genus Polynomial of Cubic Graphs

The orientable genus polynomial of a graph counts its cellular embeddings by genus. For finite simple $2$-connected cubic graphs it is a cycle-matroid invariant: $M(G)\cong M(H)$ implies $Γ_G=Γ_H$. The adjacency spectrum and the genus polynomial are incomparable: neither determines the other. We exhibit connected cubic graphs on $16$ vertices sharing the adjacency spectrum, spanning-tree count, girth, diameter, vertex and edge connectivity, automorphism-group order, and cycle counts through length $10$, yet with pairwise distinct genus polynomials. Splitting the expected face count at twice the girth explains the difference: short faces are spectral, long faces are not. We construct an explicit infinite family of connected cospectral cubic pairs $(G_t,H_t)$ on $14+2t$ vertices whose minimum genera differ. We also compute the genus polynomials of all $7,875,918$ connected cubic graphs through $22$ vertices and derive from short-cycle counts a deterministic lower bound on the minimum genus.

math.CO↗

An Efficient Genus Algorithm Based on Graph Rotations

We study the problem of determining the minimal genus of a simple finite connected graph. We present an algorithm which, for an arbitrary graph $G$ with $n$ vertices and $m$ edges, determines the orientable genus of $G$ in $O(n(4^m/n)^{n/t})$ steps where $t$ is the girth of $G$. This algorithm avoids difficulties that many other genus algorithms have with handling bridge placements which is a well-known issue. The algorithm has a number of useful properties for practical use: it is simple to implement, it outputs the faces of an optimal embedding, and it iteratively narrows both upper and lower bounds. We illustrate the algorithm by determining the genus of the $(3,12)$ cage (which is 17); other graphs are also considered.

cs.DM↗