Packing large balanced trees into bipartite graphs (Q6933600)

A family \(\mathcal{H}\) of graphs packs into a graph \(G\) if \(G\) contains pairwise edge-disjoint copies of all the members of \(\mathcal{H}\). The authors prove hat for every \(\gamma > 0 \) there exists \(n_0\in \mathbb{N}\) such that for every \( n\geq n_0 \) any family of up to \(n^{1/2-\gamma}\) trees having at most \((1-\gamma)n\) vertices in each bipartition class can be packed into \(K_{n,n}\). They also show an approximate bipartite version of the Komlós-Sárközy-Szemerédi theorem.