Large set of P 3 ‐decompositions

Let G =( V ( G ), E ( G )) be a graph. A ( n , G , λ)‐ GD is a partition of the edges of λ K n into subgraphs ( G ‐blocks), each of which is isomorphic to G . The ( n , G ,λ)‐ GD is named as graph design for G or G ‐decomposition. The large set of ( n , G ,λ)‐ GD is denoted by ( n , G ,λ)‐ LGD . In this work, we obtain the existence spectrum of ( n , P 3 ,λ)‐ LGD . © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008