Join
Smallest universal point sets for planar graphs
Find the smallest point set on which every planar graph with n vertices can be drawn with straight edges: do O(n) points suffice?
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