Graham's tree reconstruction conjecture
Statement
Let be a simple undirected graph. A tree is an acyclic, connected graph. Its line graph has vertex set , with distinct adjacent exactly when and are incident in . Define the iterated line graphs by
and
Graham's tree reconstruction conjecture. For each sequence of natural numbers , all the conditions for are satisfied by at most one tree .
The conjecture asks whether the sequence of sizes of a tree and all its iterated line graphs uniquely determines the tree. Apart from a few simple observations, little is known; the paper gives lower bounds on the number of trees distinguishable by these sequences but does not resolve the conjecture.
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.