# perfect matching-proof

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.

-
Is this homework? What have you learnt about in class? Could you say what you've tried? –  Colin McQuillan Jul 7 '12 at 9:23