The token-reconstruction-family conjecture
The token-reconstruction-family conjecture
Let be a graph, let denote its -token graph, and let a -token reconstruction family of be a family of subsets as defined in the source. Let and be two such reconstruction families, and let denote the automorphism group of . Token-reconstruction-family conjecture. There exists such that
The source presents this as a reformulation of the preceding reconstruction conjecture using a proposition about -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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.