Skip to content

Author

Maciej Cisiński

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Nov 2026

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...

Maciej Cisiński · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.