set_coloring_ramsey_property
Given 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 edge-coloring ϕ : (⊤ : SimpleGraph (Fin N)).edgeSet → Finset (Fin r) assigning an s-element finite subset of Fin r to each edge of the complete graph on Fin N, there exists a t-element finite subset T : Finset (Fin r) such that the support graph support_graph ϕ T contains a copy of G.
Statement
def set_coloring_ramsey_property {V : Type*} (G : SimpleGraph V) (r s t N : ℕ) : Prop
- Defined in
- scout/2611-15376-set-coloring-ramsey-numbers-with-multiple-intersections.md:147
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Built on 1
- support_graphGiven a type V, a natural number r, an edge-labeling function ϕ : (⊤ : SimpleGraph V).edgeSet → Finset (Fin r) assigning a finite subset…
- Used by 14
- set_coloring_ramsey_numberGiven 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…
- 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_property_of_succFor any simple graph G on a type V and natural numbers r, s, t, N, if set_coloring_ramsey_property G r s (t + 1) N holds, then…
- not_set_coloring_ramsey_property_p3_one_even_thresholdFor all integers a ≥ b ≥ 1, there exists an (a, b)-set-coloring of the complete graph on 2 * ⌊(a + b) / (2 * b)⌋ vertices without a…
- 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_property_mono_NFor any simple graph G, palette size r, edge subset size s, intersection parameter t, and natural numbers N ≤ M, if every (r,…
- 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…
- le_of_not_set_coloring_ramsey_property_p3If there exists an (a, b)-set-coloring of the complete graph K_N without a monochromatic two-edge path P_3 in any single color, then b *…
- set_coloring_ramsey_property_p3_one_thresholdFor all integers a ≥ b ≥ 1, every (a, b)-set-coloring of the complete graph on 2 * ⌊(a + b) / (2 * b)⌋ + 1 vertices contains a…
- witness_family_ramsey_propertyFor every simple graph G on a type V, natural numbers r, s, t, b, N, and family W of subsets of Fin r such that every member of W has…
- 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)…
- shadow_ramsey_propertyFor every simple graph G on a type V and natural numbers r, s, t, N, if the set-coloring Ramsey property set_coloring_ramsey_property G…
Read back from the Lean
set_coloring_ramsey_property is a predicate on a simple graph G with vertex type V and four natural numbers r, s, t, N. It asserts that:
For every function ϕ assigning each edge of the complete graph on Fin N a finite subset of Fin r,
if every edge e has (ϕ e).card = s (every edge is assigned exactly s colors),
then there exists a subset of colors T : Finset (Fin r) such that:
1. T.card = t (T contains exactly t colors), and
2. G is contained (in the sense of SimpleGraph.IsContained) in support_graph ϕ T, which is the subgraph of the complete graph on Fin N consisting of those edges whose color sets contain T.
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 property at N. -/ def set_coloring_ramsey_property {V : Type*} (G : SimpleGraph V) (r s t N : ℕ) : Prop := ∀ ϕ : (⊤ : SimpleGraph (Fin N)).edgeSet → Finset (Fin r), (∀ e, (ϕ e).card = s) → ∃ T : Finset (Fin r), T.card = t ∧ SimpleGraph.IsContained G (support_graph ϕ T)