Erdős Problem #642 — Let f(n) be the maximal number of edges in a graph on n vertices such that all cycles have more vertices than diagonals. Is it true that f(n)≪ n?
Statement
Let be the maximal number of edges in a graph on vertices such that all cycles have more vertices than diagonals. Is it true that ?
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.