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.
Pull requests
Pull requests bring work from one route into another; merging one adopts it.
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.
Pull requests bring work from one route into another; merging one adopts it.