color_avoiding_subgraph
def
For a simple graph G and an edge colouring c with colours in C, the j-avoiding subgraph color_avoiding_subgraph G c j is the spanning subgraph of G whose edges are all edges of G not assigned colour j.
Statement
def color_avoiding_subgraph {V C : Type*} (G : SimpleGraph V) (c : G.edgeSet → C) (j : C) : SimpleGraph V
- Defined in
- arXiv:2611.11187, Section 2.1
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Used by 2
- weakened_cycle_ramsey_propertyThe weakened cycle Ramsey property weakened_cycle_ramsey_property t ℓ n holds if every t-edge-colouring of the complete graph K_n contains…
- not_op_1406_weakened_cycle_ramsey_number_ge_selfThe statement
op_1406_weakened_cycle_ramsey_number_ge_selfis false: The case t = 1 makes it false. weakened_cycle_ramsey_property t ℓ n…
Read back from the Lean
Given types V and C, a simple graph G on vertex type V, an edge-coloring c : G.edgeSet → C, and a specific color j : C, color_avoiding_subgraph G c j is defined as the simple graph on vertex type V whose edges are those edges e of G such that c e ≠ j (i.e., the spanning subgraph of G obtained by deleting all edges colored j).
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 j-avoiding subgraph of G under an edge colouring c, formed by edges not of colour j. -/ def color_avoiding_subgraph {V C : Type*} (G : SimpleGraph V) (c : G.edgeSet → C) (j : C) : SimpleGraph V := SimpleGraph.fromEdgeSet {e | ∃ h : e ∈ G.edgeSet, c ⟨e, h⟩ ≠ j}