Maximum matchings in a regular graph of specified connectivity and bounded order

Upper bounds are placed on the order of a k-regular m-connected graph G that produce a lower bound on the number of independent edges in G. As a corollary, we obtain the order of a smallest k-regular m-connected graph which has no 1-factor.

[1]  G. Chartrand,et al.  A note on 1-factors in graphs , 1979 .

[2]  J. Petersen.  Die Theorie der regulären graphs , 1891 .

[3]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[4]  W. T. Tutte.  The Factorization of Linear Graphs , 1947 .

[5]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[6]  G. Chartrand,et al.  A sufficient condition for graphs with 1-factors , 1979 .