A survey on the existence ofG-Designs

Autor:	Darryn Bryant, Melinda Buchanan, Peter Adams
Rok vydání:	2008
Předmět:	Combinatorics Discrete mathematics Current (mathematics) Complete graph Decomposition (computer science) Discrete Mathematics and Combinatorics Order (group theory) Path graph State (functional analysis) Complement graph Mathematics
Zdroj:	Journal of Combinatorial Designs. 16:373-410
ISSN:	1520-6610 1063-8539
DOI:	10.1002/jcd.20170
Popis:	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
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::06b1a4087719f6a3abd73085146c9961 https://doi.org/10.1002/jcd.20170 Zobrazit plný text záznamu Plný text