1
$\begingroup$

Let every vertex of a graph $G$ have $\delta=3$ and let $G$ have no cut-edge. Then prove that $G$ has a perfect matching. A cut edge is an edge whose deletion increases the number of connected components.

  • 1
    Is this homework? What have you learnt about in class? Could you say what you've tried?2012-07-07

1 Answers 1

0

This is the so called Petersen Theorem which can be proven using Tutte's theorem

Let me know if you need a more in depth proof.

  • 0
    A more in-depth proof would be fantastic.2012-07-07