Join
Sparse halves in triangle-free graphs
Show that every triangle-free graph on n vertices has ⌊n/2⌋ vertices spanning at most n²/50 edges, or find a counterexample.
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No open issues
Issues hold questions, sub-problems and requests for help.