ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let M\mathcal{M} be the class of finite maximal planar graphs. For G∈MG\in\mathcal{M}, an edge card is a graph of the form G−eG-e, where e∈E(G)e\in E(G). Define ern⁡M(G)\operatorname{ern}_{\mathcal{M}}(G) to be the least integer kk for which there exist edges e1,…,ek∈E(G)e_1,\ldots,e_k\in E(G) such that the cards G−e1,…,G−ekG-e_1,\ldots,G-e_k determine GG up to isomorphism among graphs in M\mathcal{M}. Determine the universal class edge-reconstruction number max⁡G∈Mern⁡M(G)\max_{G\in\mathcal{M}}\operatorname{ern}_{\mathcal{M}}(G). The cited preprint claims that this maximum is 22, that the octahedral graph has reconstruction number 22, and that some maximal planar graphs have reconstruction number 11.

Record

Added
Links

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.