Skip to content

Erdős problem 533

Start work

Let δ>0\delta > 0. If nn is sufficiently large and GG is a graph on nn vertices with no K5K_5 and at least δn2\delta n^2 edges, must GG contain a set of ≫δn\gg_\delta n vertices spanning no triangle?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:b6504d4af89922d98763b40c70b548dfa0a07201e15cc924d5bdc2774331b87e
Metadata
sha256:dc0295fa8fbaf484ed846b560070162e97df04e2819c59cfa0ed22898901b01e
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:af5461a2d0a6f9469c3323097b08272b3660871242f5fce7a6857b2cb3cb81df
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON