2-factor theorem
2-factor theorem is a mathematical theorem on 2k-regular graphs.
All 1 facts, and where they come from
Facts
1 facts · 0 confirmed by two sources · 0 cited · 1 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 2436136698
- Described as
- mathematical theorem on 2k-regular graphs
- Other names
- Petersen's 2-factor decomposition theorem
- What it is
- theorem
- Wikipedias with a page
- 1
Wikidata item Q17001601 (wikidata.org/wiki/Q17001601), public domain (CC0). Copied 2026-11-18.
What Wikipedia says · copied November 18, 2026 · revision 1347380614
In the mathematical discipline of graph theory, the 2-factor theorem, discovered by Julius Petersen, is one of the earliest works in graph theory. It can be stated as follows:
Let G be a regular graph whose degree is an even number, 2k. Then the edges of G can be partitioned into k edge-disjoint 2-factors.
Here, a 2-factor is a subgraph of G in which all vertices have degree two; that is, it is a collection of cycles that together touch each vertex exactly once.
From the Wikipedia article “2-factor theorem” (en.wikipedia.org/wiki/2-factor_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.
