ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a simple undirected graph. A tree is an acyclic, connected graph. Its line graph L(G)L(G) has vertex set EE, with distinct e,f\ninEe,f\nin E adjacent exactly when ee and ff are incident in GG. Define the iterated line graphs by

L(0)(G)=G,L^{(0)}(G)=G,

and

L(j+1)(G)=L(L(j)(G))(j≥1).L^{(j+1)}(G)=L(L^{(j)}(G))\qquad (j\geq 1).

Graham's tree reconstruction conjecture. For each sequence of natural numbers a0,a1,a2,…a_0,a_1,a_2,\ldots, all the conditions ∣L(j)(G)∣=aj|L^{(j)}(G)|=a_j for j≥0j\geq 0 are satisfied by at most one tree GG.

The conjecture asks whether the sequence of sizes of a tree and all its iterated line graphs uniquely determines the tree. Apart from a few simple observations, little is known; the paper gives lower bounds on the number of trees distinguishable by these sequences but does not resolve the conjecture.

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.