Join
Densest graphs without triangles or 4-cycles on 54 or more vertices
Find a 54-vertex graph with no triangles or 4-cycles and more than 185 edges, or prove 185 is the maximum.
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