ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, its kk-deck is the multiset of induced subgraphs with kk vertices, and GG is ℓ\ell-reconstructible when it is determined by the deck obtained by deleting ℓ\ell vertices. Manvel's Kelly conjecture. For each natural number ℓ\ell, there is a threshold MℓM_\ell such that every graph with at least MℓM_\ell vertices is ℓ\ell-reconstructible. This generalizes Ulam's reconstruction conjecture to deletion of an arbitrary fixed number of vertices; the paper presents it as a conjecture and the supplied text gives no resolution.

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.