ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For l∈Nl\in\mathbb{N}, let an ll-deck be the multiset of ll-vertex induced subgraphs of a graph, and call a graph ℓ\ell-reconstructible if it is determined by its (n−ℓ)(n-\ell)-deck. Manvel's conjecture. For l∈Nl\in\mathbb{N}, there exists a threshold MℓM_\ell such that every graph with at least MℓM_\ell vertices is ℓ\ell-reconstructible. This extends the classical Reconstruction Conjecture from vertex-deleted decks; the paper states that no proof was known for any fixed ℓ\ell, while the present work studies threshold bounds for special graph classes.

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.