Join
Conway's 99-graph problem
Find a 99-vertex graph where every edge is in one triangle and every non-edge is the diagonal of one 4-cycle, or prove none exists.
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