Manvel's eventual reconstructibility conjecture for graphs
Statement
For , let an -deck be the multiset of -vertex induced subgraphs of a graph, and call a graph -reconstructible if it is determined by its -deck. Manvel's conjecture. For , there exists a threshold such that every graph with at least vertices is -reconstructible. This extends the classical Reconstruction Conjecture from vertex-deleted decks; the paper states that no proof was known for any fixed , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.