k_plus_graph
The graph K_s^+ is obtained from a complete graph on s vertices by adding one vertex adjacent to exactly one clique vertex.
Statement
def k_plus_graph (s : ℕ) : SimpleGraph (Option (Fin s))- Defined in
- arXiv:2610.40279 Section 1
- Verified
- 07 Nov 2026
- Axioms
- none listed
Read back from the Lean
For any natural number s, k_plus_graph s is defined as the simple graph on vertex type Option (Fin s) constructed via SimpleGraph.fromRel from the relation where:
- two vertices some i and some j (with i, j : Fin s) are related if and only if i ≠ j;
- some i and none are related if and only if (i : ℕ) = 0;
- none and some j are related if and only if (j : ℕ) = 0;
- none and none are not related.
Equivalently, it is the simple graph with vertex set Option (Fin s) where the some i vertices form a complete graph $K_s$, and the additional vertex none is adjacent only to some 0 (when s > 0).
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 graph K_s^+ obtained from K_s by adding a vertex adjacent to exactly one clique vertex. -/ def k_plus_graph (s : ℕ) : SimpleGraph (Option (Fin s)) := SimpleGraph.fromRel fun u v => match u, v with | some i, some j => i ≠ j | some i, none => (i : ℕ) = 0 | none, some j => (j : ℕ) = 0 | none, none => False