Erdős Problem #765 — The extremal number of the four-cycle
Statement
Determine an asymptotic formula for , the largest number of edges in an -vertex graph containing no four-cycle.
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.