2 papers
math.CO2023
Settling the nonorientable genus of the nearly complete bipartite graphs
Warren Singh, Timothy Sun
A graph is said to be nearly complete bipartite if it can be obtained by deleting a set of independent edges from a complete bipartite graph. The nonorientable genus of such graphs…
math.CO2023
Face-simple minimal quadrangulations of surfaces
Sarah Abusaif, Warren Singh, Timothy Sun
For each surface besides the sphere, projective plane, and Klein bottle, we construct a face-simple minimal quadrangulation, i.e., a simple quadrangulation on the fewest number of…