Yan, Yun-Zhi; Wang, Han-Xing; Wang, Jun; Yin, Xiang-Feng - In: Statistics & Probability Letters 78 (2008) 11, pp. 1255-1258
For graphs Gn on n vertices and H(n) on hn vertices, where hn divides n, an H(n)-factor of Gn is a spanning subgraph of Gn consisting of n/hn vertex disjoint copies of H(n). Our main result has supplied a lower bound (or upper bound) of p in the problem of determining the minimal (or maximal)...