ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let λn\lambda_n denote the class of minimally nn-convergent graphs, and let the components of a graph be its connected components. A component is unicyclic when it contains exactly one cycle.

Unicyclic-components conjecture. If G∈λnG\in\lambda_n, then GG has unicyclic components.

The conjecture concerns the structure of minimally nn-convergent graphs and is presented as a proposed structural description that would facilitate further results about these graphs.

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.