simple_graph_underlying_color_graph
def
The underlying simple graph of the color graph of a simple graph G equipped with coloring c : V → α is defined on vertex type Set.range c by SimpleGraph.map (Set.rangeFactorization c) G.
Statement
def simple_graph_underlying_color_graph {V α : Type*} (G : SimpleGraph V) (c : V → α) : SimpleGraph (Set.range c)
- Defined in
- arXiv:2611.18391, Section 2
- Verified
- 16 Nov 2026
- Axioms
- none listed
- Used by 1
- op_1764_outerplanar_underlying_color_graph_of_injectiveFor every finite outerplanar simple graph G on type V in the sense of simple_graph_is_outerplanar G and every injective vertex coloring c…
Read back from the Lean
Given types V and α, a simple graph G on V, and a function c : V → α, simple_graph_underlying_color_graph G c is defined as the pushforward simple graph of G under the corestriction of c to its range (Set.rangeFactorization c : V → Set.range c).
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 underlying simple graph of the color graph of a vertex-colored graph (G, c), on vertex set Set.range c. -/ def simple_graph_underlying_color_graph {V α : Type*} (G : SimpleGraph V) (c : V → α) : SimpleGraph (Set.range c) := G.map (Set.rangeFactorization c)