MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

It's known that every cubic bridgeless graph has 1-factor (Petersen). But Does anybody know, how to prove that for every edge in a cubic bridgeless graph there exists a 1-factor, which contains it?

Because I found articles, where this is stated, but no proof of it so far (for example this one - theorem 2.1.)

Thanks in advance

share|cite|improve this question
up vote 4 down vote accepted

Petersen's theorem: A bridgeless cubic graph contains a one-factor. This has been generalized by T. Schönberger [T. Schönberger, "Ein Beweis des Peterschen Graphensatzes" Acta Sci. Math. Szeged , 7 (1934) pp. 51–57], who proved that every edge of a bridgeless cubic graph lies in a one-factor.

Best regards, Július Korbaš

share|cite|improve this answer
unfortunately, it's a german article :( but thanks – Rafael K. Nov 2 '13 at 19:09
ok I found an english source proving this: link – Rafael K. Nov 2 '13 at 22:52

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.