Harary–Schwenk–Scott conjecture for locally finite trees
Let be a locally finite tree. A graph is reconstructible if every graph hypomorphic to is isomorphic to , where hypomorphism means that there is a bijection between the vertex sets whose corresponding vertex-deleted induced subgraphs are isomorphic. Harary–Schwenk–Scott conjecture. Every locally finite tree is reconstructible. The conjecture arose after non-reconstructible infinite graphs and locally finite forests were found, and it was proposed as the corresponding positive statement for locally finite trees.
References
Status
- Refuted: Nathan Bowler, Joshua Erde, Peter Heinig, Florian Lehner, and Max Pitz. A counterexample to the reconstruction conjecture for locally finite trees (Bulletin of the London Mathematical Society, 2018) https://londmathsoc.onlinelibrary.wiley.com/doi/abs/10.1112/blms.12053
Source: Nathan Bowler, Joshua Erde, Peter Heinig, Florian Lehner and Max Pitz, “A counterexample to the reconstruction conjecture for locally finite trees”, arXiv:1606.02926 (2018).
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
No solutions have been posted yet.