Skip to content

Erdős problem 180

Start work

For every finite family F\mathcal{F} of graphs, is there a single G∈FG \in \mathcal{F} with ex(n;G)≪Fex(n;F)\mathrm{ex}(n;G) \ll_{\mathcal{F}} \mathrm{ex}(n;\mathcal{F})? A counterexample refutes the Erdős-Simonovits compactness conjecture.

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal2 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 it276 share a topic
Graph Theory275Turan Number23
None carries a Standing. Browse the topic.
Start workOpen sources