Erdős problem 80
Erdős problem 80
Result history
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 details
Exact provenance
- Problem row
- sha256:bc904392846098ed5491ec571abe2332ea798bc0e037a0fc9a3929741f315649
- Metadata
- sha256:38843f4343be67d1bbfad1011b3da5d4f8bf718d2cf86959170b9e87d7602dc5
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:c369e1c1fbef20ee5ec8c24726fe952d10fddd544634c356a9dcc3b12f688d0b
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207
Source review
Native pull-request state, mechanical checks, semantic findings, and artifact availability are separate source facts. None is a Vela Verification, Decision, or change to Math Standing.
Formal Conjectures PR #4830
FormalConjectures/ErdosProblems/80.lean
PR mergedreview approvedsource audit: needs revision
failsemantic
hypothesis satisfiability
At exact PR 4830 head e2e2a606/blob 9dd6a993, Admissible requires c*n^2 edges in a simple n-vertex graph while the theorem quantifies over every c>0.
Read-only projection