AFTD Auto-Formalizing Theoretical Domains

two_token_kmn

abbrev

The 2-token graph F_2(K_{m,n}) of the complete bipartite graph K_{m,n}.

Statement

abbrev two_token_kmn (m n : ℕ) : SimpleGraph { s : Finset (Fin m ⊕ Fin n) // s.card = 2 }
Defined in
arXiv:2610.28936 Definition 2.5
Verified
25 Oct 2026
Axioms
none listed
Built on 1
  • token_graphThe k-token graph F_k(G) of a simple graph G has as vertices the k-subsets of V(G), with two k-subsets adjacent whenever their symmetric…
Used by 5

Read back from the Lean

For two natural numbers $m$ and $n$, two_token_kmn m n is defined as the 2-token graph (token_graph ... 2) of the complete bipartite graph on parts $\text{Fin } m$ and $\text{Fin } n$, yielding a simple graph whose vertices are the 2-element finsets of $\text{Fin } m \oplus \text{Fin } n$.

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 2-token graph of the complete bipartite graph K_{m,n}. -/
abbrev two_token_kmn (m n : ℕ) : SimpleGraph { s : Finset (Fin m ⊕ Fin n) // s.card = 2 } := token_graph (completeBipartiteGraph (Fin m) (Fin n)) 2
See it in the graphDiscuss this resultChallenge it