Erdős problem 904
Let and let be the Turán number (the maximal number of edges in a graph on vertices with no ).
- Formal statements
- 1 solved
- Erdős Problems says
- proved (Lean)
- Decision here
- No current contribution
- Checks
- 0 checks · 1 formal
Current Result
Current Result
No result has been accepted here yet.
- Type
- —
- Evidence
- 0 artifacts
- Decision
- None
- Reviewed
- No date retained