On regular embedding of H-designs into G-designs

The graph H is embedded in the graph G, if H is a subgraph of G. An H-design is a decomposition of a complete graph into edge disjoint copies of the graph H, called blocks. An H-i-design with k blocks, say H-1, H-2, ...H-k is embedded in a G-design if for every H-i, there exists a distinct block, say G(i), in the G-design that embeds H-i. If G(i) are all isomorphic for 1 <= i <= k then the embedding is called regular. This paper solves the problem of the regular embedding of H-designs into G-designs when G has at most four vertices and four edges.