ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG and a positive integer NN, let

S(G;N)={S(G,c)∣c:V(G)→Z+ with c(G)=N}.S(G;N)=\{S(G,c)\mid c:V(G)\to \mathbb{Z}^+ \text{ with }c(G)=N\}.

Here S(G,c)S(G,c) is the set of sums c(H)=∑v∈V(H)c(v)c(H)=\sum_{v\in V(H)}c(v) over connected subgraphs HH of GG. Lo's conjecture. For any two non-isomorphic connected graphs G1G_1 and G2G_2 on nn vertices,

S(G1;2n−1)≠S(G2;2n−1).S(G_1;2^n-1)\not=S(G_2;2^n-1).

The conjecture asserts that the collection of subgraph-sum sets at total vertex weight 2n−12^n-1 distinguishes non-isomorphic connected graphs on the same number of vertices. It was proposed by Solomon Lo in connection with the study of tree spectra; no resolution is supplied here.

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.