Almost Every Graph Is Reconstructible from Its Token Graphs

Yuanming Luo

Let $F_k(G)$ denote the $k$-token graph of a finite graph $G$. The graph $F_k(G)$ is a spanning subgraph of $J(n,k)$, but its vertices are not given their $k$-subset labels. We sho…