REVIEW
Upper bounds on the extremal number of the 4-cycle
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Upper bounds on the extremal number of the 4-cycle
classification
math.CO
keywords
boundsnumberupperassertsasymptoticallyboundbroadconjecture
read the original abstract
We obtain some new upper bounds on the maximum number $f(n)$ of edges in $n$-vertex graphs without containing cycles of length four. This leads to an asymptotically optimal bound on $f(n)$ for a broad range of integers $n$ as well as a disproof of a conjecture of Erd\H{o}s from 1970s which asserts that $f(n)=\frac12 n^{3/2}+\frac14 n+o(n)$.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.