Abstract

We prove that for every ?>0 there exists n0?N such that for every n?n0 any family of up to [Formula presented] trees having at most (1??)n vertices in each bipartition class can be packed into Kn,n. As a tool for our proof, we show an approximate bipartite version of the Komlós–Sárközy–Szemerédi Theorem, which we believe to be of independent interest. © 2025 Elsevier B.V.