Asciak's edge-reconstruction number conjecture for regular graphs
Statement
Let be a finite, simple, connected, -regular graph with . Its edge-reconstruction number is the smallest size of a subset of its edge-deck from which is reconstructable.
Asciak's conjecture.
This conjecture concerns how many edge-cards suffice to reconstruct a regular graph. It was originally published in K. J. Asciak's 1999 master's thesis and republished in a 2010 survey of open questions in reconstruction numbers; it 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.