  We prove the Erd\H os--S\'os conjecture for trees with bounded maximum degree
and large dense host graphs. As a corollary, we obtain an upper bound on the
multicolour Ramsey number of large trees whose maximum degree is bounded by a
constant.
