A survey on the existence of G‐Designs

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

[1]  R. Julian R. Abel.  Some new BIBDs with block size 7 , 2000 .

[2]  C. McDiarmid,et al.  The Solution of a Timetabling Problem , 1972 .

[3]  Zihong Tian,et al.  Decomposing complete graphs into isomorphic subgraphs with six vertices and seven edges , 2006, Ars Comb..

[4]  Pavel Hrnciar,et al.  All trees of diameter five are graceful , 2001, Discret. Math..

[5]  Edward Dobson.  Packing trees of bounded diameter into the complete graph , 2007, Australas. J Comb..

[6]  MICHAEL TARSI.  Decomposition of a Complete Multigraph into Simple Paths: Nonbalanced Handcuffed Designs , 1983, J. Comb. Theory, Ser. A.

[7]  Marco Buratti,et al.  {$G$}-invariantly resolvable Steiner {$2$}-designs which are {$1$}-rotational over {$G$} , 1998 .

[8]  Zbigniew Lonc,et al.  On resolvable tree-decompositions of complete graphs , 1988, J. Graph Theory.

[9]  Min-Li Yu.  On tree factorizations of Kn , 1993, J. Graph Theory.

[10]  Mateja Šajna.  Cycle decompositions III: Complete graphs and fixed length cycles , 2002 .

[11]  Egmont Köhler.  Über das Oberwolfacher Problem , 1977 .

[12]  R. Fisher.  An examination of the different possible solutions of a problem in incomplete blocks. , 1940 .

[13]  Denis Hanson.  A quick proof that K10 != P + P + P , 1992, Discret. Math..

[14]  Dean G. Hoffman,et al.  On the construction of odd cycle systems , 1989, J. Graph Theory.

[15]  Ján Manuch,et al.  Spanning cubic graph designs , 2009, Discret. Math..

[16]  Michael Tarsi.  Decomposition of complete multigraphs into stars , 1979, Discret. Math..

[17]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[18]  Charles Vanden Eynden,et al.  On the cyclic decomposition of complete graphs into bipartite graphs , 2001, Australas. J Comb..

[19]  Saad El-Zanati,et al.  On ρ-labeling the union of three cycles , 2007, Australas. J Comb..

[20]  L. Beineke,et al.  The Coarseness of the Complete Graph , 1968, Canadian Journal of Mathematics.

[21]  L. Thiel,et al.  The Non-Existence of Finite Projective Planes of Order 10 , 1989, Canadian Journal of Mathematics.

[22]  N. Wormald,et al.  Isomorphic Factorization of Regular Graphs and 3-Regular Multigraphs , 1988 .

[23]  Maryvonne Mahéo.  Strongly graceful graphs , 1980, Discret. Math..

[24]  Charles Delorme,et al.  Cycles with a chord are graceful , 1980, J. Graph Theory.

[25]  Juraj Bosák,et al.  Decompositions of Graphs , 1990 .

[26]  H. J. Ryser,et al.  The Nonexistence of Certain Finite Projective Planes , 1949, Canadian Journal of Mathematics.

[27]  R. Julian R. Abel,et al.  Some new RBIBDs with block size 5 and PBDs with block sizes ≡1 mod 5 , 1997, Australas. J Comb..

[28]  Gennian Ge,et al.  Graph designs for the eight-edge five-vertex graphs , 2009, Discret. Math..

[29]  Jean-Claude Bermond,et al.  G-decomposition of Kn, where G has four vertices or less , 1977, Discret. Math..

[30]  Andrew Blinco.  On diagonal cycle systems , 2001, Australas. J Comb..

[31]  D. G. Hoffman,et al.  Impossibility of Decomposing the Complete Graph on n Points into n-1 Isomorphic Complete Bipartite Graphs , 1989, SIAM J. Discret. Math..

[32]  R.J.R. Abel.  Some new BIBDS with ? = 1 and 6 ?k ? 10 , 1996 .

[33]  Joseph A. Gallian,et al.  A Dynamic Survey of Graph Labeling , 2009, The Electronic Journal of Combinatorics.

[34]  Peter Adams,et al.  Two-factorisations of complete graphs of orders fifteen and seventeen , 2006, Australas. J Comb..

[35]  Prince Camille de Polignac.  On a Problem in Combinations , 1866 .

[36]  Darryn Bryant,et al.  Decompositions of K m, n and K n into cubes. , 1994 .

[37]  Peter Adams,et al.  Decompositions of the complete graph into small 2-regular graphs , 2002 .

[38]  Noga Alon,et al.  A note on the decomposition of graphs into isomorphic matchings , 1983 .

[39]  Charlotte Huang.  Resolvable balanced bipartite designs , 1976, Discret. Math..

[40]  W. H. Mills,et al.  Some new bibds with k = 6 and λ = 1 , 1995 .

[41]  Malcolm Greig.  Recursive Constructions of Balanced Incomplete Block Designs with Block Size of 7 , 2001, Ars Comb..

[42]  S. Houghten,et al.  There is no (46, 6, 1) block design* , 2001 .

[43]  Richard M. Wilson,et al.  On resolvable designs , 1972, Discret. Math..

[44]  H. Hanani.  The Existence and Construction of Balanced Incomplete Block Designs , 1961 .

[45]  Brian Alspach,et al.  Cycle Decompositions of Kn and Kn-I , 2001, J. Comb. Theory, Ser. B.

[46]  Elaine T. Bell.  Decomposition of Kn into cycles of length at most fifty , 1995, Ars Comb..

[47]  R. C. Bose,et al.  On the construction of sets of mutually orthogonal Latin squares and the falsity of a conjecture of Euler , 1960 .

[48]  Kazuhiko Ushio,et al.  G-designs and related designs , 1993, Discret. Math..

[49]  Jennifer D. Key,et al.  Designs and their codes , 1992, Cambridge tracts in mathematics.

[50]  Charles J. Colbourn,et al.  Minimizing drop cost for SONET/WDM networks with ⅛ wavelength requirements , 2001 .

[51]  Dominique Sotteau.  Decomposition of Km, n(Km, n*) into cycles (circuits) of length 2k , 1981, J. Comb. Theory, Ser. B.

[52]  N. Hamada,et al.  On claw-decomposition of complete graphs and complete bigraphs , 1975 .

[53]  Pauline Cain.  Decomposition of complete graphs into stars , 1974, Bulletin of the Australian Mathematical Society.

[54]  Darryn Bryant,et al.  Decomposition of complete graphs into 5-cubes , 2006 .

[55]  Jean-Claude Bermond,et al.  Decomposition of complete graphs into isomorphic subgraphs with five vertices , 1980 .

[56]  Shizhen Zhao,et al.  All Trees of Diameter Four Are Graceful , 1989 .

[57]  Anton Kotzig,et al.  Decompositions of complete graphs into isomorphic cubes , 1981, J. Comb. Theory, Ser. B.

[58]  J. Bermond,et al.  Graph decompositions and G-designs , 1976 .

[60]  R. Denniston.  Some maximal arcs in finite projective planes , 1969 .

[61]  Mike J. Grannell,et al.  Modular gracious labellings of trees , 2001, Discret. Math..

[62]  Edward Allburn,et al.  Graph decomposition , 1990 .

[63]  Min-Li Yu.  Almost resolvable Pk-decompositions of complete graphs , 1991, J. Graph Theory.

[64]  Charles Vanden Eynden,et al.  Decomposing complete graphs into cubes , 2006, Discuss. Math. Graph Theory.

[65]  D. de Werra,et al.  On some combinatorial problems arising in scheduling , 1970 .

[66]  W. H. Mills,et al.  BIBDs with κ = 6 and λ = 1 , 1996 .

[67]  Vladimir D. Tonchev,et al.  New Designs with Block Size 7 , 1998, J. Comb. Theory, Ser. A.

[68]  Douglas R. Stinson,et al.  The Oberwolfach problem and factors of uniform odd length cycles , 1989, J. Comb. Theory, Ser. A.

[69]  Charles Vanden Eynden,et al.  Near α-labelings of bipartite graphs , 2000, Australas. J Comb..

[70]  Peter Adams,et al.  Cube factorizations of complete graphs , 2004 .

[71]  Alexander Rosa,et al.  Another class of balanced graph designs: balanced circuit designs , 1975, Discret. Math..

[72]  A. Khodkar,et al.  The spectrum problem for close m- trails, m 10 , 2000 .

[74]  Qiang Li,et al.  Decomposition of lambda-fold complete graphs into a certain five-vertex graph , 2004, Australas. J Comb..

[75]  Jean-Claude Bermond,et al.  Existence of Resolvable Path Designs , 1990, Eur. J. Comb..

[76]  Yanxun Chang.  The spectra for two classes of graph designs , 2002, Ars Comb..