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.
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.