Erdős Problem #765 — The extremal number of the four-cycle
Determine an asymptotic formula for , the largest number of edges in an -vertex graph containing no four-cycle.
References
Primary source
Additional references
P. Erdős, Extremal problems on graphs and hypergraphs, in Hypergraph Seminar, Lecture Notes in Mathematics 411 (1974), 75–84.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.