On the matching extendability of graphs in surfaces (Q2464156)

A graph \(G\) of order at least \(2n+ 2\) is \(n\)-extendable if every matching of \(n\) pairs of vertices extends to a perfect matching. The authors show that: (1) If \(G\) of order large enough is imbedded on a closed 2-manifold (either orientable or nonorientable), then \(G\) is not 4-extendable. (2) Given \(k\geq 0\) (respectively \(h\geq 2\)), there are infinitely many graphs of orientable genus \(k\) (respectively nonorientable genus \(h\)) which are 3-extendable. (3) If \(G\) is a 5-connected graph of even order, with an orientable triangulation of positive genus and representativity large enough, then \(G\) is 2-extendable.