Abstract: Let F = {G_1, G_2, ..., G_k} be a family of k graphs, each on n vertices. Then F packs if there exists an edge disjoint placement of all these graphs into the complete graph K_n.
Directions of studying packing of graphs were defined about 25 years ago by fundamental papers of Bollobás and Eldridge, and Sauer and Spencer. In this talk, we discuss three conjectures of Bollobás and Eldridge. We prove a partial case of the main Bollobás-Eldridge-Catlin Conjecture. Apart from this, we extend a conjecture and disprove another conjecture from their paper. We apply results on packing of two graphs to packing many sparse graphs.