Erdős Problem #85 — Monotonicity of the Minimum-Degree Threshold for a Four-Cycle
Statement
Let be the smallest integer such that every simple graph on vertices with minimum degree at least contains a cycle of length . Is it true that, for all sufficiently large ,
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.