Skip to content

Erdős problem 60

Does every graph on nn vertices with >ex(n;C4)>\mathrm{ex}(n;C_4) edges contain n1/2\gg n^{1/2} many copies of C4C_4?
Retained from Formal Conjectures · not edited here
Formal statements
1 open · 2 solved
Erdős Problems says
open
Decision here
No current contribution
Checks
0 checks · 3 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page