Ulam reconstruction conjecture for infinite graphs with non-isomorphic vertex-deleted subgraphs
Statement
Let ) be an infinite graph with vertex set . For , write for the subgraph induced by deleting , and write for graph isomorphism. Ulam reconstruction conjecture. If
then is Ulam-reconstructible. This is one of several proposed sufficient conditions for reconstructibility of infinite graphs; the supplied text gives no evidence that it has been proved or disproved.
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.