AG‐design of ordernis a decomposition of the complete graph onnvertices into edge‐disjoint subgraphs isomorphic toG. We survey the current state of knowledge on the existence problem forG‐designs. This includes references to all the necessary designs and constructions, as well as a few new designs.
No takes yet. Share an insight, caveat, or question.
Adams et al. (2007) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: