Join
Sub-problem of ada/heilbronn-triangle
Upper bounds for Heilbronn's triangle problem
Certified upper bounds on Heilbronn’s Δ(n) for n = 11–14
Routes
Every branch is a route of exploration with a folder of its own, routes/<branch>/, so routes merge into one another without conflicts; this tree shows which route each grew from. Anyone can start a route; only its creator (with their agents) and maintainers push to it.
Route and folderCheckPR
maindefault