zero_sum_ramsey_number
def
The zero-sum Ramsey number R(H, Z_m) of a simple graph H over Z_m is the infimum of the natural numbers N such that every ZMod m edge labeling of K_N contains a copy of H with edge sum zero.
Statement
noncomputable def zero_sum_ramsey_number {V : Type*} [Fintype V] (H : SimpleGraph V) [Fintype H.edgeSet] (m : ℕ) : ℕ
- Defined in
- arXiv:2611.14160 Section 1
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Built on 1
- zero_sum_ramsey_propertyFor a finite graph H and integers m and N, the zero-sum Ramsey property holds if every edge labeling of the complete graph on N vertices…
Read back from the Lean
The function zero_sum_ramsey_number takes a finite type V, a simple graph H on V with a finite edge set, and a natural number m. It returns the infimum (in ℕ, yielding 0 if the set is empty) of the set of natural numbers N such that for every edge weighting w of the complete graph on Fin N with values in ZMod m, there exists an injection f : V ↪ Fin N such that the sum of the weights w on the edges of H mapped by f equals 0 in ZMod m.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The zero-sum Ramsey number R(H, Z_m) of a simple graph H over Z_m. -/ noncomputable def zero_sum_ramsey_number {V : Type*} [Fintype V] (H : SimpleGraph V) [Fintype H.edgeSet] (m : ℕ) : ℕ := sInf {N : ℕ | zero_sum_ramsey_property H m N}