Packing minor-closed families of graphs into complete graphs

Motivated by a conjecture of Gyárfás, recently Böttcher, Hladký, Piguet, and Taraz showed that every collection T1,…,TtT1,…,Tt of trees on n   vertices with ∑i=1te(Ti)⩽(n2) and with bounded maximum degree can be packed into the complete graph on (1+o(1))n(1+o(1))n vertices. We generalise 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.