ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Λn\Lambda_n denote the class of graphs whose PnP_n-line graph sequences converge, and let λn\lambda_n denote the class of minimally nn-convergent graphs. For graphs GG and G′G', write G′⊆GG'\subseteq G when G′G' is a subgraph of GG.

Unique minimal subgraph conjecture. If G∈ΛnG\in\Lambda_n and GG is not the disconnected union of two graphs in Λn\Lambda_n, then there exists a unique graph G′∈λnG'\in\lambda_n such that G′⊆GG'\subseteq G.

The conjecture is proposed as a further direction in the study of minimally nn-convergent graphs; the preceding theorem gives a related preservation result for unicyclic components under an additional girth hypothesis.

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.