Harary–Schwenk–Scott conjecture for locally finite trees
Statement
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. The paper constructs a counterexample, so the conjecture is refuted.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.