John Wittnebel, Master’s candidate
David R. Cheriton School of Computer Science
In this thesis, we study lower bounds on maximum matchings in 1-planar graphs. We expand upon the tools used for proofs of matching bounds in other classes of graphs as well as some original ideas in order to find these bounds. The first novel results we provide are lower bounds of maximum matching in 1-planar graphs as a function of their minimum degree.
We show that for sufficiently large n, 1-planar graphs with minimum degree 3 have a maximum matching of size at least (n+12)/7, 1-planar graphs with minimum degree 4 have a maximum matching of size at least (n+4)/3, and 1-planar graphs with minimum degree 5 have a maximum matching of size at least (2n+3)/5. We also give examples of 1-planar graphs with the corresponding minimum degree that meet these bounds, showing that all of these bounds are tight. We also give examples of 1-planar graphs with small maximum matching and minimum degree 6 and 7. We conjecture that the 1-planar graph of minimum degree 6 presented has the smallest maximum matching over all 1-planar graphs of minimum degree 6, but it is unclear if the method used for the cases of minimum degree 3, 4, and 5 would work for minimum degree 6.
We also study lower bounds in the class of maximal 1-plane graphs, and 3-connected maximal 1-plane graphs. We find that 3-connected, maximal 1-plane graphs have a maximum matching of size at least (n+4)/3, and that maximal 1-plane graphs have a maximum matching of size at least (n+6)/4. Again, we present examples of such a graph to show this bound is tight. We also show that every simple 3-connected maximum 1-planar graph has a matching of size at least (2n+6)/5, and provide some evidence that this is tight.
200 University Avenue West
Waterloo, ON N2L 3G1