AFTD Auto-Formalizing Theoretical Domains

graph_is_mutual_visibility_colorable

def

A simple graph G is mutual-visibility n-colorable if there exists a coloring of the vertices of G with n colors such that every color class is a mutual-visibility set.

Statement

def graph_is_mutual_visibility_colorable {V : Type*} (G : SimpleGraph V) (n : ℕ) : Prop
Defined in
arXiv:2610.39430, Definition 1.1
Verified
30 Oct 2026
Axioms
none listed
Built on 1
  • graph_is_mutual_visibility_setA set S of vertices of a simple graph G is a mutual-visibility set if for every pair of vertices u, v in S, there exists a shortest walk…
Used by 4

Read back from the Lean

For a simple graph G on vertex type V and a natural number n, asserts that there exists a coloring c : V → Fin n such that for every color i : Fin n, the fiber {v : V | c v = i} is a mutual-visibility set in G (i.e., graph_is_mutual_visibility_set G {v | c v = i}).

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

/-- A graph admits a mutual-visibility colouring with n colours if its vertices can be partitioned into n mutual-visibility sets. -/
def graph_is_mutual_visibility_colorable {V : Type*} (G : SimpleGraph V) (n : ℕ) : Prop := ∃ c : V → Fin n, ∀ i : Fin n, graph_is_mutual_visibility_set G {v | c v = i}
See it in the graphDiscuss this resultChallenge it