Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Cubic matching-complement bridge

Proved
CubicP3Partition.cubic_matching_complement_iff_two_factor

by hao jia · Sep 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricscubic-graphsgraph-theoryp3-factor

Let GGG be a finite simple cubic graph. Then GGG has a perfect matching whose relative complement is a spanning 2-factor with every component order divisible by three if and only if GGG has a spanning 2-factor with every component order divisible by three:

HasDivisibleComplement⁡(G)⟺HasDivisibleTwoFactor⁡(G).\operatorname{HasDivisibleComplement}(G) \quad\Longleftrightarrow\quad \operatorname{HasDivisibleTwoFactor}(G).HasDivisibleComplement(G)⟺HasDivisibleTwoFactor(G).

No connectivity or nonemptiness hypothesis is imposed. This bridge identifies the matching formulation of the strengthened route with its 2-factor formulation.

Preamble
import Definitions.Def_cubic_p3_partition_models
Formal statement
namespace CubicP3Partition

universe u

/-- In a cubic graph, divisible complementary perfect matchings and divisible 2-factors coincide. -/
theorem cubic_matching_complement_iff_two_factor
    {V : Type u} [Fintype V] (G : SimpleGraph V) (hCubic : Cubic G) :
    HasDivisibleComplement G ↔ HasDivisibleTwoFactor G := by sorry

end CubicP3Partition
Source
Vibe Mathing C01, https://github.com/vibemathing/problem-opg-46613-cubic-p3-partition/blob/14b8dc64ac2d89c98cf3a2bbb2fcba76ced0df6a/research/artifacts/candidates/opg46613-c01/proof.md, Section 2 (C01.1), fixed revision 14b8dc64ac2d89c98cf3a2bbb2fcba76ced0df6a.
Read-back

What the Lean code literally says, in plain math · gpt-5.6-luna

对宇宙 uuu 中的任意类型 VVV(带有 Fintype V 实例)、任意定义在 VVV 上的简单图 GGG,以及假设 hCubic:对每个 v∈Vv∈Vv∈V,满足 G.AdjvwG.Adj v wG.Adjvw 的 www 的自然数基数恰好为 333,定理声明以下两个命题等价。左侧是:存在一个简单图 MMM 定义在 VVV 上,使每条 MMM 边都是 GGG 的边且每个顶点在 MMM 中恰有一个邻居;令 CMC_MCM​ 为满足 x∼CMyx∼_{C_M}yx∼CM​​y 当且仅当 x∼Gyx∼_G yx∼G​y 且不满足 x∼Myx∼_M yx∼M​y 的图,则每条 CMC_MCM​ 边都是 GGG 的边、每个顶点在 CMC_MCM​ 中恰有两个邻居,并且对每个 v∈Vv∈Vv∈V,在 CMC_MCM​ 中从 vvv 可达的顶点数量是 333 的倍数。右侧是:存在一个简单图 FFF 定义在 VVV 上,使每条 FFF 边都是 GGG 的边、每个顶点在 FFF 中恰有两个邻居,并且对每个 v∈Vv∈Vv∈V,在 FFF 中从 vvv 可达的顶点数量是 333 的倍数。等价关系是双向的;除了有限性实例、图 GGG 和 hCubic 外,没有连通性、阶数或非空性前提,因而也包括空的有限顶点类型情形。

Human review
  • Endorsed by Shuze Chen · Sep 7, 2026

  • Endorsed by hao jia · Sep 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me