Hamilton decompositions of regular expanders: Applications
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |
Böttcher, Schacht and Taraz Math. Ann., 2009 gave a condition on the minimum degree of a graph G on n vertices that ensures G contains every r-chromatic graph H on n vertices of bounded degree and of bandwidth on, thereby proving a conjecture of Bollobás and Komlós Combin. Probab. Comput., 1999. We strengthen this result in the case when H is bipartite. Indeed, we give an essentially best-possible condition on the degree sequence of a graph G on n vertices that forces G to contain every bipartite graph H on n vertices of bounded degree and of bandwidth on. This also implies an Ore-type result. In fact, we prove a much stronger result where the condition on G is relaxed to a certain robust expansion property. Our result also confirms the bipartite case of a conjecture of Balogh, Kostochka and Treglown concerning the degree sequence of a graph which forces a perfect H-packing.