On the relationship between the genus and the cardinality of the maximum matchings of a graph

AbstractLower bounds on the cardinality of the maximum matchings of graphs are established in terms of a linear polynomial of p, p(1), p(2) and γ whose coefficients are functions of κ, where p is the number of the vertices of a graph, p(i) the number of the vertices of degree i (i = 1,2), γ the genus and κ the connectivity