The token-reconstruction-family conjecture

Let GG be a graph, let Fk(G)F_k(G) denote its kk-token graph, and let a kk-token reconstruction family of Fk(G)F_k(G) be a family of subsets as defined in the source. Let cmathcalRcmathcal{R} and cmathcalRcmathcal{R}' be two such reconstruction families, and let cmathrmAut(Fk(G))cmathrm{Aut}(F_k(G)) denote the automorphism group of Fk(G)F_k(G). Token-reconstruction-family conjecture. There exists cpsicincmathrmAut(Fk(G))cpsicincmathrm{Aut}(F_k(G)) such that

cmathcalR={cpsi(X):X\incmathcalRφ,}cmathcal{R}'=\{cpsi(X):X\incmathcal{R}_\varphi,\}

The source presents this as a reformulation of the preceding reconstruction conjecture using a proposition about kk-token reconstructions. The supplied excerpt does not establish whether this reformulated conjecture has been resolved.

Sources & referencesView supporting material

Primary source

Ruy Fabila-Monroy and Ana Laura Trujillo-Negrete, “Connected (C_4,Diamond)-free Graphs Are Uniquely Reconstructible from Their Token Graphs”, arXiv:2207.12336 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.