Packing graphs: The packing problem solved (Q1378488)

Summary: For every fixed graph \(H\), we determine the \(H\)-packing number of \(K_n\), for all \(n> n_0(H)\). We prove that if \(h\) is the number of edges of \(H\), and gcd\((H)=d\) is the greatest common divisor of the degrees of \(H\), then there exists \(n_0=n_0(H)\), such that for all \(n> n_0\), \[ P(H,K_n)=\Biggl\lfloor \frac{dn}{2h} \biggl\lfloor \frac{n-1}{d} \biggr\rfloor \Biggr\rfloor, \] unless \(n= 1 \bmod d\) and \(n(n-1)/d= b \bmod (2h/d)\) where \(1 \leq b \leq d\), in which case \[ P(H,K_n)=\Biggl\lfloor \frac{dn}{2h} \biggl\lfloor \frac{n-1}{d} \biggr\rfloor \Biggr\rfloor-1. \] Our main tool in proving this result is the deep decomposition result of Gustavsson.