Premium
A survey on the existence of G ‐Designs
Author(s) -
Adams Peter,
Bryant Darryn,
Buchanan Melinda
Publication year - 2008
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.20170
Subject(s) - mathematics , combinatorics , disjoint sets , graph , order (exchange) , enhanced data rates for gsm evolution , discrete mathematics , computer science , artificial intelligence , finance , economics
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom