{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:50:23Z","timestamp":1720054223710},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T00:00:00Z","timestamp":1538784000000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1016\/j.disc.2014.05.021","type":"journal-article","created":{"date-parts":[[2014,6,20]],"date-time":"2014-06-20T20:45:28Z","timestamp":1403297128000},"page":"60-68","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["On the existence spectrum for sharply transitiveG<\/mml:mi><\/mml:math>-designs,G<\/mml:mi><\/mml:math>a[<\/mml:mo>k<\/mml:mi>]<\/mml:mo><\/mml:mrow><\/mml:math>-matching"],"prefix":"10.1016","volume":"332","author":[{"given":"A.","family":"Bonisoli","sequence":"first","affiliation":[]},{"given":"S.","family":"Bonvicini","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2014.05.021_br000005","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1002\/jcd.20170","article-title":"A survey on the existence of G-designs","volume":"16","author":"Adams","year":"2008","journal-title":"J. Combin. Des."},{"key":"10.1016\/j.disc.2014.05.021_br000010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/666","article-title":"Cyclic and dihedral 1-factorizations of multipartite graphs","volume":"18","author":"Bogaerts","year":"2011","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.disc.2014.05.021_br000015","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jcd.1025","article-title":"One-factorizations of complete graphs with vertex-regular automorphism groups","volume":"10","author":"Bonisoli","year":"2002","journal-title":"J. Combin. Des."},{"key":"10.1016\/j.disc.2014.05.021_br000020","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/j.disc.2006.11.052","article-title":"Frattini-based starters in 2-groups","volume":"308","author":"Bonvicini","year":"2008","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2014.05.021_br000025","unstructured":"M. Buratti, A description of any regular or 1-rotational design by difference methods, in: Combinatorics 2000 Gaeta (Italy), 28 May\u20133 June 2000, Booklet of the Abstracts and Invited Lectures. Univesit\u00e0 \u201cLa Sapienza\u201d Roma, pp. 35\u201352. (http:\/\/www.mat.uniroma1.it\/~combinat\/gaeta)."},{"key":"10.1016\/j.disc.2014.05.021_br000030","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1006\/eujc.2000.0475","article-title":"Abelian 1-factorizations of the complete graph","volume":"22","author":"Buratti","year":"2001","journal-title":"European J. Combin."},{"key":"10.1016\/j.disc.2014.05.021_br000035","first-page":"91","article-title":"Cycle decompositions with a sharply vertex transitive automorphism group","volume":"59","author":"Buratti","year":"2004","journal-title":"Matematiche (Catania)"},{"key":"10.1016\/j.disc.2014.05.021_br000040","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jcd.21311","article-title":"Dihedral Hamiltonian cycle systems of the cocktail party graph","volume":"21","author":"Buratti","year":"2013","journal-title":"J. Combin. Des."},{"key":"10.1016\/j.disc.2014.05.021_br000045","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/jcd.20163","article-title":"1-rotational k-factorizations of the complete graph and new solutions to the Oberwolfach problem","volume":"16","author":"Buratti","year":"2008","journal-title":"J. Combin. Des."},{"key":"10.1016\/j.disc.2014.05.021_br000050","article-title":"The structure of 2-pyramidal 2-factorizations","author":"Buratti","year":"2014","journal-title":"Graphs Combin."},{"key":"10.1016\/j.disc.2014.05.021_br000055","series-title":"Parallelisms of Complete Designs","first-page":"66","author":"Cameron","year":"1976"},{"key":"10.1016\/j.disc.2014.05.021_br000060","series-title":"Combinatorial Math. and its Applications","first-page":"561","article-title":"Edge colorings in bipartite graphs","author":"Folkman","year":"1969"},{"key":"10.1016\/j.disc.2014.05.021_br000065","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1017\/S144678870001778X","article-title":"Adders for the patterned starter in nonabelian groups","volume":"21","author":"Gross","year":"1976","journal-title":"J. Aust. Math. Soc. Ser. A"},{"key":"10.1016\/j.disc.2014.05.021_br000070","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0195-6698(85)80020-2","article-title":"Cyclic one-factorizations of the complete graph","volume":"6","author":"Hartman","year":"1985","journal-title":"European J. Combin."},{"key":"10.1016\/j.disc.2014.05.021_br000075","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/jcd.3180020403","article-title":"Sharply transitive 1-factorizations of the complete graph with an invariant 1-factor","volume":"2","author":"Korchm\u00e1ros","year":"1994","journal-title":"J. Combin. Des."},{"key":"10.1016\/j.disc.2014.05.021_br000080","series-title":"R\u00e9cr\u00e9ations Math\u00e9matiques, Vol. 2","first-page":"161","author":"Lucas","year":"1883"},{"key":"10.1016\/j.disc.2014.05.021_br000085","first-page":"1410","article-title":"Symmetric 1-factorizations of the complete graph","volume":"31","author":"Pasotti","year":"2010","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2014.05.021_br000090","first-page":"23","article-title":"Cyclic (0,1)-factorizations of the complete graph","volume":"4","author":"Rees","year":"1988","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/j.disc.2014.05.021_br000095","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/jcd.20069","article-title":"Nilpotent 1-factorizations of the complete graph","volume":"13","author":"Rinaldi","year":"2005","journal-title":"J. Combin. Des."},{"key":"10.1016\/j.disc.2014.05.021_br000100","series-title":"Group Theory","author":"Scott","year":"1987"},{"key":"10.1016\/j.disc.2014.05.021_br000105","unstructured":"The GAP Group, GAP\u2014groups, algorithms, and programming, version 4.7.4; 2014. (http:\/\/www.gap-system.org)."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X14002179?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X14002179?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,8,21]],"date-time":"2020-08-21T06:34:04Z","timestamp":1597991644000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X14002179"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":21,"alternative-id":["S0012365X14002179"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2014.05.021","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2014,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the existence spectrum for sharply transitive -designs, a -matching","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2014.05.021","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}