Skip to content

Erdős problem 128

Start work

Let G be a graph with n vertices such that every induced subgraph on ≥ n/2n/2 vertices has more than n2/50n^2/50 edges. Must G contain a 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:6d6f33f13cf62c29fbff60d9bd7aa2b1d3704ee8ea4d9ac61a8bdfbed81b4725
Metadata
sha256:527f3469e0259631f4d0cb8075c91804d82011b25b2c11b5f554a0df3c6e8755
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:8e390f8456f6225e6e670b2bc000ee71c61dc2c18dfd2dfe5981d9032ebb158e
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON