Kára and Král's exact minimum degree for 31-vertex cycle chords
Statement
For integers and , let be the least integer such that every -vertex graph with minimum degree at least contains a cycle with at least chords. Kára and Král's conjecture.
Their known bounds are , so the conjecture asks whether the lower bound is sharp. The supplied text gives no resolution evidence.
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.