Almost Every Graph Is Reconstructible from Its Token Graphs
Yuanming Luo
math.COarXiv:2608.22094
Abstract
Let Fk(G) denote the k-token graph of a finite graph G. The token graph reconstruction conjecture asks whether, for any 1 k<|V(G)|, Fk(G) Fk(H) implies G H. This paper proves that the conjecture holds for almost every graph.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato