Matchings in 1-planar graphs with large minimum degree

Therese Biedl, John Wittnebel

In 1979, Nishizeki and Baybars showed that every planar graph with minimum degree 3 has a matching of size $\frac{n}{3}+c$ (where the constant $c$ depends on the connectivity), and…