Packing minor closed families of graphs

Motivated by a conjecture of Gyárfás, recently Böttcher, Hladký, Piguet, and Taraz showed that every collection T1,…,Tn of trees on n vertices with and with bounded maximum degree, can be packed into the complete graph on (1+o(1))n vertices. We generalize this result where we relax the restriction of packing families of trees to families of graphs of any given non-trivial minor closed class of graphs.