ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. An edge-deck is the multiset

ED(G)=G−e:e∈E(G).\mathcal{E}\mathcal{D}(G)=\\{G-e:e\in E(G)\\}.

A graph is edge-reconstructible if it is uniquely determined, up to isomorphism, by its edge-deck. Harary's Edge Reconstruction Conjecture. Every graph with at least 44 edges is edge-reconstructible, i.e., it is uniquely determined by its edge-deck. This edge-focused variant of graph reconstruction was proposed by Harary and remains open in general.

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.