Packing subdivisions into regular graphs

Abstract

We show that, for any graph $F$ and $\hat{I}\cdot >0$, there exists a $d_0=d_0(F,\hat{I}\cdot )$ such that every $n$-vertex $d$-regular graph with $d\ge d_0$ has a collection of vertex-disjoint $F$-subdivisions covering at least $(1-\hat{I}\cdot )n$ vertices. This verifies a conjecture of Verstraëte from 2002 and improves a recent result of Letzter, Methuku and Sudakov which additionally required $d$ to be at least polylogarithmic in $n$.

10 pages, 1 figure. Version accepted to appear in Proceedings of the American Mathematical Society