Petersen's theorem
Petersen's theorem is an every cubic bridgeless graph has a perfect matching.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 18, 2026 · revision 2436134813
- Described as
- every cubic bridgeless graph has a perfect matching
- What it is
- theorem
- Named after
- Julius Petersen
- Wikipedias with a page
- 5
Wikidata item Q7178199 (wikidata.org/wiki/Q7178199), public domain (CC0). Copied 2026-11-18.
What Wikipedia says · copied November 18, 2026 · revision 1379018982
In the mathematical discipline of graph theory, Petersen's theorem, named after Julius Petersen, is one of the earliest results in graph theory and can be stated as follows:
Petersen's Theorem. Every cubic, bridgeless graph contains a perfect matching.
In other words, if a graph has exactly three edges at each vertex, and every edge belongs to a cycle, then it has a set of edges that touches every vertex exactly once.
From the Wikipedia article “Petersen's theorem” (en.wikipedia.org/wiki/Petersen's_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-18; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
Picture: Wikimedia Commons: Petersen-graph-factors.svg · See Commons file page
