ProbXiv
Explorersign in
Problem archiveProblem record

Statement

All graphs below are finite, simple and undirected.

For a graph G=(V,E)G=(V,E), a vertex-deleted subgraph of GG is a subgraph G−vG-v obtained by deleting exactly one vertex v∈Vv \in V together with all edges incident to it; it is an induced subgraph of GG. The deck of GG is the multiset

D(G)={ ⁣{ [G−v]  :  v∈V } ⁣},D(G) = \{\!\{\, [G-v] \;:\; v \in V \,\}\!\},

where [H][H] denotes the isomorphism class of HH; the members of D(G)D(G) are called cards. Two graphs GG and HH are hypomorphic if D(G)=D(H)D(G) = D(H) as multisets.

An edge-deleted subgraph of GG is a subgraph G−eG-e obtained by deleting exactly one edge e∈Ee \in E (keeping all vertices), and the edge-deck of GG is the multiset

ED(G)={ ⁣{ [G−e]  :  e∈E } ⁣}.ED(G) = \{\!\{\, [G-e] \;:\; e \in E \,\}\!\}.

(1) Reconstruction. For every pair of graphs GG and HH with ∣V(G)∣=∣V(H)∣≥3|V(G)| = |V(H)| \ge 3, if D(G)=D(H)D(G) = D(H) then G≅HG \cong H.

(2) Set reconstruction. For every pair of graphs GG and HH with ∣V(G)∣=∣V(H)∣≥4|V(G)| = |V(H)| \ge 4, if the sets of isomorphism classes of vertex-deleted subgraphs of GG and of HH coincide, that is, if D(G)D(G) and D(H)D(H) have the same underlying set, then G≅HG \cong H.

(3) Edge reconstruction. For every pair of graphs GG and HH with at least four edges, if ED(G)=ED(H)ED(G) = ED(H) then G≅HG \cong H.

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.