ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥4n\geq 4, and let G1,…,GkG_1,\dots,G_k be a collection of nn-edged graphs for some k≥1k\geq 1. Write ∐i=1kED⁡(Gi)\coprod_{i=1}^k\operatorname{ED}(G_i) for the disjoint union of their edge decks. Generalized edge reconstruction conjecture. For every k≥1k\geq 1, the collection {G1,…,Gk}\{G_1,\dots,G_k\} is uniquely reconstructible from ∐i=1kED⁡(Gi)\coprod_{i=1}^k\operatorname{ED}(G_i). This is explicitly disproved in the paper: for every n≥2n\geq 2, some finite collection is not reconstructible, so the conjecture is false.

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.