Online packing of the three largest trees
For every $n\ge4$, arbitrary trees of orders $n,n-1,n-2$ can be packed into $K_n$ online, in decreasing order of size: each tree must be embedded before the next is revealed, and earlier embeddings cannot be changed. This strengthens the classical three-tree packing theorem of Hobbs, Bourgeois and Kasiraj (1987). In pa...