ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let l∈Nl\in\mathbb{N}. An ll-card of a graph is an induced subgraph obtained by deleting ll vertices, and the corresponding deck is the multiset of all such cards. A graph is ll-reconstructible if it is determined by this deck.

Kelly's conjecture. For l∈Nl\in\mathbb{N}, there is an integer MlM_l such that any graph with at least MlM_l vertices is reconstructible from its deck of cards obtained by deleting ll vertices.

This is a more detailed version of the Reconstruction Conjecture. The original conjecture is the special case M1=3M_1=3; the asserted existence of a threshold for every ll 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.