Manvel's Kelly conjecture on large-graph \ell-reconstructibility
Statement
For a graph , its -deck is the multiset of induced subgraphs with vertices, and is -reconstructible when it is determined by the deck obtained by deleting vertices. Manvel's Kelly conjecture. For each natural number , there is a threshold such that every graph with at least vertices is -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.