ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G(n)G(n) be the family of graphs with nn vertices, 2n−22n-2 edges, and no proper subgraph of minimum degree 33.

Erdős–Faudree–Gould–Scheinerman conjecture. Every G∈G(n)G\in G(n) contains cycles of length ii for every integer 3≤i≤k3\le i\le k, where kk tends to infinity with nn.

The conjecture concerns how long an initial sequence of cycle lengths must occur in graphs just below the edge threshold forcing a proper subgraph of minimum degree 33. The source gives no resolution.

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.