AFTD Auto-Formalizing Theoretical Domains

set_coloring_ramsey_number

def

Given a type V, a simple graph G on V, and natural numbers r, s, t, set_coloring_ramsey_number G r s t is the infimum in ℕ of the set of natural numbers N such that set_coloring_ramsey_property G r s t N holds.

Statement

noncomputable def set_coloring_ramsey_number {V : Type*} (G : SimpleGraph V) (r s t : ℕ) : ℕ
Defined in
scout/2611-15376-set-coloring-ramsey-numbers-with-multiple-intersections.md:147
Verified
13 Nov 2026
Axioms
none listed
Built on 1
  • set_coloring_ramsey_propertyGiven a type V, a simple graph G on V, and natural numbers r, s, t, N, set_coloring_ramsey_property G r s t N asserts that for every…
Used by 6
  • witness_family_ramsey_number_leFor every simple graph G on a type V, natural numbers r, s, t, b, and family W of subsets of Fin r such that every member of W has…
  • set_coloring_ramsey_number_mono_tFor any simple graph G on a type V and natural numbers r, s, t, if there exists N such that set_coloring_ramsey_property G r s (t + 1) N…
  • set_coloring_ramsey_number_p3_oneFor all integers a ≥ b ≥ 1, the set-coloring Ramsey number of the two-edge path P_3 with intersection parameter t = 1 is given by R(P_3;…
  • op_1628_ramsey_spectrum_consecutive_equality_existsThere exists a type V with a Fintype instance, a simple graph G on V such that G is connected and has at least two edges, and natural…
  • op_1628_p3_consecutive_equalityThe set-coloring Ramsey numbers for the path graph pathGraph 3 with palette parameters r = 4 and s = 3 satisfy set_coloring_ramsey_number…
  • shadow_ramsey_number_leFor every simple graph G on a type V and natural numbers r, s, t, if there exists N such that set_coloring_ramsey_property G (r.choose t)…

Read back from the Lean

For a type V, a simple graph G on V, and natural numbers r, s, and t, set_coloring_ramsey_number G r s t is defined as the infimum (sInf) in ℕ of the set of all N : ℕ satisfying set_coloring_ramsey_property G r s t N. Here, set_coloring_ramsey_property G r s t N asserts that for every function ϕ assigning each edge of the complete graph on Fin N a subset of Fin r, if |ϕ(e)| = s for every edge e, then there exists a subset T ⊆ Fin r with |T| = t such that G is contained (SimpleGraph.IsContained) in the support graph support_graph ϕ T. The support graph support_graph ϕ T is the simple graph on vertex set Fin N whose edges are those edges e of the complete graph on Fin N for which T ⊆ ϕ(e).

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 generalized set-coloring Ramsey number R(G; r, s, t). -/
noncomputable def set_coloring_ramsey_number {V : Type*} (G : SimpleGraph V) (r s t : ℕ) : ℕ :=
  sInf {N : ℕ | set_coloring_ramsey_property G r s t N}
See it in the graphDiscuss this resultChallenge it