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.

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:e34e0612c56d0bd5bb1e852ad4d0a7564956abeaffc8246f36543579bba96bf9
Metadata
sha256:ef0cf9edad39c36c9765d69506d45caac3cc57493d033f880abac175122dfedd
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:2b5b4a4e510f366d35de9a4d680b9cf8de2ed891832e8d23d1b8e7c0dd49ce83
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON