Woodall's circumference conjecture
Statement
Let ) be a 2-connected graph on vertices, and let denote the length of a longest cycle in . Woodall's conjecture. If there are at least vertices of degree at least , then
This conjecture is proved in the paper as an application of the strengthened Erdős–Gallai theorem.
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.