A note on packing trees into complete bipartite graphs and on Fishburn's conjecture (Q914692)

A result by \textit{A. M. Hobbs, B. A. Bourgeois} and \textit{J. Kasiraj} [Discrete Math. 67, 27-42 (1987; Zbl 0642.05043)] is improved by showing that any sequence of trees \(\{T_ 2,T_ 3,...,T_ t\}\), where \(T_ i\) is of order i, can be packed into the complete bipartite graph \(K_{n- 1,n/2}\) (n even) for \(t\approx 0,3\cdot n\). A further result supporting \textit{P. C. Fishburn}'s conjecture [J. Graph Theory 7, 369-383 (1983; Zbl 0556.05020)] is proved.