AFTD Auto-Formalizing Theoretical Domains

simple_graph_edge_is_rich

def

In an edge colouring c, an edge e is rich if all edges adjacent to e receive pairwise distinct colours.

Statement

def simple_graph_edge_is_rich {V α : Type*} (G : SimpleGraph V) (c : G.edgeSet → α)
    (e : G.edgeSet) : Prop
Defined in
arXiv:2610.21868 (Rich-neighbor 5-edge-colorings of subcubic graphs whose 3-vertices induce a matching), Sec. 1 (definition of a rich edge).
Verified
16 Oct 2026
Axioms
none listed
Used by 10

Lean source view module on GitHub

/-- `e` is rich for `c`: the edges adjacent to `e` have pairwise distinct colours. -/
def simple_graph_edge_is_rich {V α : Type*} (G : SimpleGraph V) (c : G.edgeSet → α)
    (e : G.edgeSet) : Prop :=
  ∀ f g : G.edgeSet, G.lineGraph.Adj e f → G.lineGraph.Adj e g → f ≠ g → c f ≠ c g
See it in the graphDiscuss this resultChallenge it