balanced_complete_multipartite_graph
def
For natural numbers r and n, balanced_complete_multipartite_graph r n is the simple graph on Fin (r * n) in which u and v are adjacent exactly when u / n ≠ v / n (natural-number division of the vertex values): the complete r-partite graph T_{r,n} = K_{n,...,n} whose parts are the blocks {kn, ..., kn + n - 1}, k < r.
Statement
def balanced_complete_multipartite_graph (r n : ℕ) : SimpleGraph (Fin (r * n))- Defined in
- arXiv:2610.18636 (spectral distances; nearest spectra to complete multipartite graphs): the complete multipartite graph K_{n,...,n}
- Verified
- 27 Oct 2026
- Axioms
- none listed
- Used by 3
- balanced_multipartite_nearest_spectral_distanceFor natural numbers r and n, balanced_multipartite_nearest_spectral_distance r n = c_r(n) is the infimum in ℝ (a minimum over a finite set…
- balanced_complete_multipartite_graph_adjIn balanced_complete_multipartite_graph r n, u and v are adjacent iff u / n ≠ v / n.
- balanced_multipartite_nearest_spectral_distance_nonnegThe nearest squared spectral distance c_r(n) is nonnegative.
Read back from the Lean
Given natural numbers r and n, balanced_complete_multipartite_graph r n is defined as the simple graph on the vertex set Fin (r * n) where two vertices u and v are adjacent if and only if (u : ℕ) / n ≠ (v : ℕ) / n (using natural number division).
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
def balanced_complete_multipartite_graph (r n : ℕ) : SimpleGraph (Fin (r * n)) := { Adj := fun u v => (u : ℕ) / n ≠ (v : ℕ) / n, symm := ⟨fun _ _ h => Ne.symm h⟩, loopless := ⟨fun _ h => h rfl⟩ }