Incident edge occurrences are bounded by the degree
ProvedZeroFreeRRG.Hardcore.incident_edge_reps_card_le_degreeIn a configuration-model matching on degree-d vertices, the number of edge occurrences incident to any vertex is at most d, including loops and repeated edges.
Preamble
import Definitions.Def_ZeroFreeRRG_Hardcore_ConfigModel import Mathlib set_option autoImplicit false open Set Filter MeasureTheory AFIsingKS ZeroFreeRRG.Hardcore open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.incident_edge_reps_card_le_degree (d n : ℕ) (M : Matching n d) (v : Fin n) :
((edgeReps M).filter (fun x => x.1 = v ∨ (M.1 x).1 = v)).card ≤ d := by sorrySource
Chunyang Wang et al., 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, Appendix E.3, proof of Lemma 4.20, Step 1 (supporting argument).