\(H\)-packing of \(k\)-chromatic graphs (Q1937363)

Let \(H\) and \(G\) be graphs, and let \(p_H(G)\) denote the maximum number of edges covered by a set of edge-disjoint copies of \(H\) in \(G\). In this paper, the author consider the problem of edge-packing and determine the relationship between \(p_H(G)\) and \(p_{K_k}(G)\) where \(H\) is \(k\)-chromatic. Moreover, the author also gave some applications of the result in extremal graph theory.