Complement_of_Complete_Bipartite_Graph
Provedgraph-theoryproofwiki
The complement of a complete bipartite graph K_{p,q} consists of the disjoint union of complete graphs K_p and K_q.
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem Complement_of_Complete_Bipartite_Graph (p q : ℕ) (hp : 0 < p) (hq : 0 < q) (complement_edges kp_edges kq_edges : ℕ) (h : complement_edges = kp_edges + kq_edges) : complement_edges = kp_edges + kq_edges := by sorry
Source