Admissible configuration-model matching spaces are nonempty
ProvedZeroFreeRRG.Hardcore.matching_nonempty_evenIf the number of configuration-model half-edges is even, then there exists a perfect matching of those half-edges, including the empty matching when .
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.