The generalized edge reconstruction conjecture
Statement
Let , and let be a collection of -edged graphs for some . Write for the disjoint union of their edge decks. Generalized edge reconstruction conjecture. For every , the collection is uniquely reconstructible from . This is explicitly disproved in the paper: for every , some finite collection is not reconstructible, so the conjecture is false.
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.