Kelly's conjecture on reconstructibility from vertex-deleted decks
Statement
Let . An -card of a graph is an induced subgraph obtained by deleting vertices, and the corresponding deck is the multiset of all such cards. A graph is -reconstructible if it is determined by this deck.
Kelly's conjecture. For , there is an integer such that any graph with at least vertices is reconstructible from its deck of cards obtained by deleting vertices.
This is a more detailed version of the Reconstruction Conjecture. The original conjecture is the special case ; the asserted existence of a threshold for every remains open.
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.