Maximal matchings in graphs with given minimal and maximal degrees

Abstract

In this note we determine the greatest lower bound of the number of independent edges in a graph in terms of the number of vertices, the minimal degree and the maximal degree. More generally we examine the greatest lower bound of the number of independent edges in aK-connected (or λ-edge-connected) graph with given number of vertices and given minimal and maximal degrees. These results extend those of Erdös and Pósa (3) and Weinstein (7). Our proof makes heavy use of Berge's slight extension of Tutte's characterization of graphs with 1-factors.