Skip to content

Erdős problem 60

Start work

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?

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal3 retained
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingResolution

No source retained here records an outcome for this question.

Its collection still marks it open.

Open the source record
Where the source files it274 share a topic
Graph Theory275Cycles22
None carries a Standing. Browse the topic.
Start workOpen sources