Let and be two simple graphs, where is a subgraph of . A -decomposition of , denoted by -GD, is a partition of all the edges of into subgraphs (G-blocks), each of which is isomorphic to . A large set of -GD, denoted by -LGD, is a partition of all subgraphs isomorphic to of into -GDs (called small sets). In this paper, we investigate the existence of -LGD and obtain some existence results, where is a prime.
Keywords: large set; K,,,-decomposition; complete bipartite graph