Harary's Edge Reconstruction Conjecture for graphs
Statement
Let be a graph. An edge-deck is the multiset
A graph is edge-reconstructible if it is uniquely determined, up to isomorphism, by its edge-deck. Harary's Edge Reconstruction Conjecture. Every graph with at least edges is edge-reconstructible, i.e., it is uniquely determined by its edge-deck. This edge-focused variant of graph reconstruction was proposed by Harary and remains open in general.
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.