The logarithmic-degree conjecture for cycles with linearly many chords
Statement
Let be a graph on vertices, and let be a positive constant. A cycle with linearly many chords is a cycle on vertices having at least chords.
Cycle-with-chords conjecture. If has average degree at least , then contains a cycle on vertices with at least chords, for some .
The surrounding discussion presents this as a conjectural strengthening of the paper's results on cycles with almost linearly many chords; it also suggests that the regular-graph case may be a natural first step. The source gives no evidence that the conjecture has been resolved.
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.