AFTD Auto-Formalizing Theoretical Domains

simple_graph_achromatic_number

def

χ_a(G) is the maximum number of colours in an achromatic colouring of G.

Statement

noncomputable def simple_graph_achromatic_number {V : Type*} (G : SimpleGraph V) : ℕ
Defined in
arXiv:2610.27510 (The achromatic number of Paley graphs, Peisert graphs, and related Cayley graphs), Sec. 1, definition of χ_a
Verified
21 Oct 2026
Axioms
none listed
Built on 1
Used by 5

Lean source view module on GitHub

/-- The achromatic number χ_a(G): the largest number of colours in an achromatic colouring. -/
noncomputable def simple_graph_achromatic_number {V : Type*} (G : SimpleGraph V) : ℕ :=
  sSup {k : ℕ | ∃ C : G.Coloring (Fin k), simple_graph_coloring_is_achromatic C}
See it in the graphDiscuss this resultChallenge it