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
- two_token_kmn_leftsThe set of left vertices (in Fin m) occurring in a 2-element vertex {u,v} of F_2(K_{m,n}).
- two_token_kmn_rightsThe set of right vertices (in Fin n) occurring in a 2-element vertex {u,v} of F_2(K_{m,n}).
- two_token_kmn_lr_vertexThe LR vertex {x,y} determined by a left vertex x and a right vertex y.
- two_token_kmn_ll_vertexThe LL vertex {x,y} determined by two distinct left vertices x != y.
- two_token_kmn_rr_vertexThe RR vertex {x,y} determined by two distinct right vertices x != y.
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