← All papers
First page of A proof of the 3-Decomposition Conjecture

A proof of the 3-Decomposition Conjecture

Jicheng Ma

math.CO Aug 26, 2026 · v3
The paper's results, including the proof of the 3-Decomposition Conjecture, are fully formalized in Lean 4, with a public GitHub repository.
We prove the 3-Decomposition Conjecture: every finite connected cubic loopless multigraph decomposes into a spanning tree, a 2-regular subgraph, and a matching. The proof rests on a new theorem on matching complements in subcubic graphs. Let H be a finite connected bridgeless simple graph of maximum degree three, and let S be its set of degree-two vertices, with |S| = k >= 2. We show that H has a matching of size equal to its cyclomatic number, |E(H)| - |V(H)| + 1, whose deletion leaves a single tree containing all of S, together with cycles disjoint from S. The proof is by induction on k.

The 3-Decomposition Conjecture (Hoffmann-Ostenhof, 2011) states that every finite connected cubic loopless multigraph decomposes into a spanning tree, a 2-regular subgraph, and a matching. It had been open for fifteen years.

The proof rests on a new theorem on matching complements in connected bridgeless simple subcubic graphs with k >= 2 degree-two vertices. Such a graph has a matching of size equal to its cyclomatic number whose deletion leaves one tree containing all degree-two vertices, plus cycles disjoint from them. This is proved by induction on k, using Schönberger's perfect-matching theorem and a Borse–Waphare removable-cycle theorem. The result yields the 2-Decomposition Conjecture and extends to multigraphs, which gives the full conjecture.

Every connected cubic loopless multigraph has a 3-decomposition. A complete Lean 4 formalization of the results is publicly available.