ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite, simple, connected, rr-regular graph with r≥3r\geq 3. Its edge-reconstruction number ern(G)ern(G) is the smallest size of a subset of its edge-deck from which GG is reconstructable.

Asciak's conjecture.

ern(G)≤2.ern(G)\leq 2.

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 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.