Erdős–Faudree–Gould–Scheinerman conjecture on cycles in sparse graphs
Statement
Let be the family of graphs with vertices, edges, and no proper subgraph of minimum degree .
Erdős–Faudree–Gould–Scheinerman conjecture. Every contains cycles of length for every integer , where tends to infinity with .
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 . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.