ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph. The notation Λn\Lambda_n denotes the class of graphs whose PnP_n-line graph sequences converge, and G1,G2G_1,G_2 are subgraphs of GG.

Non-isomorphic subgraph conjecture. If G1≇G2G_1\not\cong G_2 and G1,G2∈ΛnG_1,G_2\in\Lambda_n, then GG has a sequence that diverges by order.

The preceding theorem establishes divergence when the two distinct subgraphs belong to the more restricted family δn\delta_n; this conjecture proposes the corresponding statement for arbitrary non-isomorphic subgraphs in Λn\Lambda_n.

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.