Independence and matching numbers of some token graphs

Hernan de Alba, Walter Carballosa, Jesús Leaños +1

Let $G$ be a graph of order $n$ and let $k\in \{1,\dots ,n-1\}$. The $k$-token graph $F_k(G)$ of $G$, is the graph whose vertices are the $k$-subsets of $V(G)$, where two vertices a…