complete_split_graph
def
The complete split graph K_k + \bar{K}_{n-k} on vertex set Fin n, where vertices with index less than k form a clique and all edges exist between this clique and the remaining n-k independent vertices.
Statement
def complete_split_graph (n k : ℕ) : SimpleGraph (Fin n)- Defined in
- arXiv:2609.14826: Section 3
- Verified
- 10 Nov 2026
- Axioms
- none listed
Read back from the Lean
The function complete_split_graph, given natural numbers n and k, defines the SimpleGraph on vertex type Fin n whose adjacency relation relates two vertices u and v if and only if u ≠ v and at least one of u.val < k or v.val < k holds.
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
/-- Complete split graph K_k + \bar{K}_{n-k} on Fin n. -/ def complete_split_graph (n k : ℕ) : SimpleGraph (Fin n) where Adj u v := u ≠ v ∧ (u.val < k ∨ v.val < k)