Erdős problem 128 · problems.science

Let G be a graph with n vertices such that every induced subgraph on ≥ $n/2$ vertices has more than $n^2/50$ edges. Must G contain a triangle?

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.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:6d6f33f13cf62c29fbff60d9bd7aa2b1d3704ee8ea4d9ac61a8bdfbed81b4725
Metadata: sha256:527f3469e0259631f4d0cb8075c91804d82011b25b2c11b5f554a0df3c6e8755
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:8e390f8456f6225e6e670b2bc000ee71c61dc2c18dfd2dfe5981d9032ebb158e

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207