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
- graph_11_mutual_visibility_chromatic_number_eq_threeThe simple graph G_11 has mutual-visibility chromatic number 3, chromatic number 3, and diameter 2.
- graph_mutual_visibility_chromatic_number_le_chromatic_number_of_diam_twoFor every finite simple graph G of diameter 2, the mutual-visibility chromatic number of G is at most the chromatic number of G.
- graph_mutual_visibility_chromatic_numberThe mutual-visibility chromatic number of a simple graph G is the infimum in ℕ∞ of the natural numbers n such that G is mutual-visibility…
- graph_11_not_is_mutual_visibility_colorable_twoThe simple graph G_11 is not mutual-visibility 2-colorable.
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}