I want to show that a simple connected $(2k + 1)$-regular graph, which is $2k$-edge connected (k ≥ 1), has a perfect matching.
A simple connected $(2k + 1)$-regular graph, which is $2k$-edge connected (k ≥ 1), has a perfect matching.
0
$\begingroup$
graph-theory
1 Answers
1
This statement is generalized by Bäbler's theorem. You can read it with proof here (theorem 8.11).