A survey on the existence of<i>G</i>‐Designs

Abstract

Abstract A G ‐design of order n is a decomposition of the complete graph on n vertices into edge‐disjoint subgraphs isomorphic to G . We survey the current state of knowledge on the existence problem for G ‐designs. This includes references to all the necessary designs and constructions, as well as a few new designs. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 373–410, 2008