Erdős problem 905 · problems.science

Every graph with $n$ vertices and $>n^2/4$ edges contains an edge which is in at least $n/6$ triangles.

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:c41c38c9f29388a43a57184cb4c95f24f33a3ede7a51b820c897870b817bcc90
Metadata: sha256:d6a1caab85c5310508aac4a9f4076101cf3692d77c5cd7b35f71d8efe4d12607
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:0196dd8174acbb88dda34655b2a36c78c1aaa3e639a2d17aaca184e620b71020

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