support_graph
Given a type V, a natural number r, an edge-labeling function ϕ : (⊤ : SimpleGraph V).edgeSet → Finset (Fin r) assigning a finite subset Finset (Fin r) to each edge of the complete graph on V, and a target finite subset T : Finset (Fin r), support_graph ϕ T is the SimpleGraph on V whose edges are those edges e of the complete graph on V for which T ⊆ ϕ e.
Statement
def support_graph {V : Type*} {r : ℕ} (ϕ : (⊤ : SimpleGraph V).edgeSet → Finset (Fin r)) (T : Finset (Fin r)) : SimpleGraph V
- Defined in
- scout/2611-15376-set-coloring-ramsey-numbers-with-multiple-intersections.md:510
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Used by 8
- 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_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,…
- 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 *…
- 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…
- 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…
Read back from the Lean
Given a type V, a natural number r, a function ϕ assigning to each edge of the complete simple graph on V a subset of Fin r (i.e. ϕ : (⊤ : SimpleGraph V).edgeSet → Finset (Fin r)), and a subset T : Finset (Fin r), support_graph ϕ T is the SimpleGraph V obtained via SimpleGraph.fromEdgeSet from the set of edges e ∈ (⊤ : SimpleGraph V).edgeSet satisfying T ⊆ ϕ e. In other words, it is the subgraph of the complete graph on V containing precisely those edges whose label under ϕ contains 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 support graph H_T of an edge set-coloring ϕ with respect to a subset T of colors. -/ def support_graph {V : Type*} {r : ℕ} (ϕ : (⊤ : SimpleGraph V).edgeSet → Finset (Fin r)) (T : Finset (Fin r)) : SimpleGraph V := SimpleGraph.fromEdgeSet {e | ∃ h : e ∈ (⊤ : SimpleGraph V).edgeSet, T ⊆ ϕ ⟨e, h⟩}