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.
Erdős Problems records this as falsifiable.
No Repository has ruled on it here.
How far the record reaches4 of 6 stages
- Sourceerdos-problems
- StatementRetained
- Formal6 retained
- Resolutionfalsifiable
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingWork
Nothing here has checked that finding.
Reproducing it here turns a report into evidence.
Where the source files it274 share a topic
None carries a Standing. Browse the topic.