Erdős problem 23
The blow-up of shows that the bound in Erdős Problem 23 is tight: any bipartite subgraph must omit at least edges.
- Formal statements
- 1 open · 2 solved · 3 test
- Erdős Problems says
- falsifiable
- Decision here
- No current contribution
- Checks
- 0 checks · 6 formal
Current Result
Current Result
No result has been accepted here yet.
- Type
- —
- Evidence
- 0 artifacts
- Decision
- None
- Reviewed
- No date retained