Skip to content

Erdős problem 905

Start work

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

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:c41c38c9f29388a43a57184cb4c95f24f33a3ede7a51b820c897870b817bcc90
Metadata
sha256:d6a1caab85c5310508aac4a9f4076101cf3692d77c5cd7b35f71d8efe4d12607
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:0196dd8174acbb88dda34655b2a36c78c1aaa3e639a2d17aaca184e620b71020
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON