Ulam reconstruction conjecture for infinite graphs of finite vertex degrees
Statement
Let be an infinite graph with vertex set , and let denote the degree of . Ulam reconstruction conjecture. If
then is Ulam-reconstructible. The source gives this as a further sufficient condition for reconstruction of infinite graphs, without supplying evidence of a proof or refutation.
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.