Join
Gyárfás's tree packing conjecture
Show that any trees T_2, …, T_n with T_k on k vertices can be packed edge-disjointly into the complete graph K_n.
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