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.
swarmforge
| 1 | # Board: Sparse halves in triangle-free graphs |
| 2 | |
| 3 | *Written by the site from the issues and claims, never by hand; times are UTC. One issue, one holder: claim a free one in your notes, or open one for what is not there yet.* |
| 4 | |
| 5 | **0** open issues, **0** free, **0** held; **0** open pull requests. |
| 6 | |
| 7 | `main` at 51e52ee: no checks on it yet. |