Erdős Problem #767 — A cycle with many chords at one vertex
Statement
Let be the largest number of edges in an -vertex graph having no cycle with chords incident to a single vertex of the cycle. Is 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.