The number of 1-factors in 2k-connected graphs

Authors

Béla Bollobas, Faculty of MathematicsFollow

Abstract

Mader [Arch. Math. 23 (1972), 219-224] determined the minimal number of 1-factors in a 2k-connected graph having at least one 1-factor. We give a simple proof of this result and slightly extend it. © 1978.

Publication Title

Journal of Combinatorial Theory, Series B

Recommended Citation

Bollobas, B. (1978). The number of 1-factors in 2k-connected graphs. Journal of Combinatorial Theory, Series B, 25 (3), 363-366. https://doi.org/10.1016/0095-8956(78)90011-4