Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Admissible configuration-model matching spaces are nonempty

Proved
ZeroFreeRRG.Hardcore.matching_nonempty_even

by wcysai · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

If the number ndndnd of configuration-model half-edges is even, then there exists a perfect matching of those half-edges, including the empty matching when nd=0nd=0nd=0.

Preamble
import Mathlib
import Definitions.Def_AFIsingKS_Matching
set_option autoImplicit false
open AFIsingKS
Formal statement
theorem ZeroFreeRRG.Hardcore.matching_nonempty_even (n d : ℕ) (he : Even (n*d)) : Nonempty (Matching n d) := by sorry
Source
Auxiliary configuration-model fact for Chen–Wang–Zhang, Zero-Freeness for Random Regular Graphs up to the Replica Symmetry Breaking Threshold, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/1461.pdf, Definition 2.1 and §4.3.

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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me