k99_join_compl_k2
The complete bipartite join graph K_{9,9} ∨ Compl(K_2) has vertex set Fin 9 ⊕ Fin 9 ⊕ Fin 2, where the first two parts of size 9 induce a complete bipartite graph K_{9,9}, and the third part consists of two isolated vertices joined to all vertices of the bipartite graph.
Statement
def k99_join_compl_k2 : SimpleGraph (Fin 9 ⊕ Fin 9 ⊕ Fin 2)- Defined in
- arXiv:2611.09347 Definition 1 -- A Structural Lower Bound for the Ramsey Number of the Petersen Graph
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Used by 1
- k99_join_compl_k2_not_adj_join_verticesIn the complete bipartite join graph K_{9,9} ∨ Compl(K_2), the two vertices in the independent set of size 2 are not adjacent to each other.
Read back from the Lean
The definition k99_join_compl_k2 is a simple graph whose vertex type is Fin 9 ⊕ (Fin 9 ⊕ Fin 2) (a disjoint union of three sets of sizes 9, 9, and 2). Two vertices are adjacent if and only if they lie in different components of this three-way disjoint union (that is, between the first Fin 9 and the second Fin 9, between the first Fin 9 and the Fin 2, or between the second Fin 9 and the Fin 2). There are no edges between vertices within the same component. In other words, it is the complete tripartite graph $K_{9, 9, 2}$ (the join of $K_{9, 9}$ and an empty graph on 2 vertices $\overline{K_2}$).
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 complete bipartite join graph K_{9,9} ∨ K_2ᶜ on Fin 9 ⊕ Fin 9 ⊕ Fin 2. -/ def k99_join_compl_k2 : SimpleGraph (Fin 9 ⊕ Fin 9 ⊕ Fin 2) where Adj | Sum.inl _, Sum.inr (Sum.inl _) => True | Sum.inr (Sum.inl _), Sum.inl _ => True | Sum.inr (Sum.inr _), Sum.inl _ => True | Sum.inl _, Sum.inr (Sum.inr _) => True | Sum.inr (Sum.inr _), Sum.inr (Sum.inl _) => True | Sum.inr (Sum.inl _), Sum.inr (Sum.inr _) => True | _, _ => False symm := ⟨by rintro (u | (u | u)) (v | (v | v)) <;> simp⟩ loopless := ⟨by rintro (u | (u | u)) <;> simp⟩