{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:59:47Z","timestamp":1720054787991},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5280,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0012-365x(99)90045-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"83-109","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Graphical t-designs via polynomial Kramer-Mesner matrices"],"prefix":"10.1016","volume":"197-198","author":[{"given":"Anton","family":"Betten","sequence":"first","affiliation":[]},{"given":"Mikhail","family":"Klin","sequence":"additional","affiliation":[]},{"given":"Reinhard","family":"Laue","sequence":"additional","affiliation":[]},{"given":"Alfred","family":"Wassermann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)90045-6_BIB1","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/S0021-9800(66)80021-2","article-title":"On the construction of block designs","volume":"1","author":"Alltop","year":"1966","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(99)90045-6_BIB2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1008263724078","article-title":"Simple 8-designs with small parameters","volume":"15","author":"Betten","year":"1998","journal-title":"Designs, Codes and Cryptography"},{"key":"10.1016\/S0012-365X(99)90045-6_BIB3","article-title":"Designs, Graphs, Codes and their Links","volume":"vol. 22","author":"Cameron","year":"1991"},{"key":"10.1016\/S0012-365X(99)90045-6_BIB4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(93)90051-T","article-title":"Block-transitive t-designs I: point-imprimitive designs","volume":"118","author":"Cameron","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90045-6_BIB5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0012-365X(91)90111-E","article-title":"Graphical t-designs with block sizes three and four","volume":"91","author":"Chee","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90045-6_BIB6","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/S0747-7171(10)80016-1","article-title":"On graphical quintuple systems","volume":"13","author":"Chee","year":"1992","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0012-365X(99)90045-6_BIB7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0012-365X(93)90067-4","article-title":"The existence of a simple 3 \u2014 (28,5,30) design","volume":"118","author":"Chee","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90045-6_BIB8","first-page":"367","article-title":"Graphical designs","author":"Chee","year":"1996"},{"key":"10.1016\/S0012-365X(99)90045-6_BIB9","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0012-365X(83)90117-6","article-title":"Graphical t-wise balanced designs","volume":"46","author":"Chouinard","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90045-6_BIB10","series-title":"Permutation Groups","author":"Dixon","year":"1996"},{"key":"10.1016\/S0012-365X(99)90045-6_BIB11","series-title":"t-designs, t \u2a7e 3, Technical Report","author":"Driessen","year":"1978"},{"key":"10.1016\/S0012-365X(99)90045-6_BIB12","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/S0012-365X(99)90045-6_BIB13","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/BF01360250","article-title":"Zu einem Isomorphiesatz von Whitney f\u00fcr Graphen","volume":"164","author":"Jung","year":"1966","journal-title":"Math. Ann."},{"key":"10.1016\/S0012-365X(99)90045-6_BIB14","first-page":"148","article-title":"On an infinite family of maximal subgroups of symmetric groups","volume":"41","author":"Klin","year":"1970","journal-title":"Trudy Nikolaevskogo Korablestroitelnogo Instituta"},{"key":"10.1016\/S0012-365X(99)90045-6_BIB15","article-title":"Investigations of algebras of invariant relations of certain classes of permutation groups","author":"Klin","year":"1974"},{"key":"10.1016\/S0012-365X(99)90045-6_BIB16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0012-365X(90)90156-C","article-title":"An S3(3,5,21) using graphs","volume":"81","author":"Kramer","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90045-6_BIB17","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0012-365X(76)90030-3","article-title":"t-designs on hypergraphs","volume":"15","author":"Kramer","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90045-6_BIB18","first-page":"47","article-title":"t-designs, t \u2a7e 3","author":"Kreher","year":"1996"},{"key":"10.1016\/S0012-365X(99)90045-6_BIB19","first-page":"111","article-title":"Eine konstruktive Version des Lemmas von Burnside","volume":"28","author":"Laue","year":"1989","journal-title":"Bayreuther Mathem. Schriften"},{"key":"10.1016\/S0012-365X(99)90045-6_BIB20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0021-8693(87)90223-7","article-title":"A classification of the maximal subgroups of the finite alternating and symmetric groups","volume":"111","author":"Liebeck","year":"1987","journal-title":"J. Algebra"},{"key":"10.1016\/S0012-365X(99)90045-6_BIB21","series-title":"A Course in Combinatorics","author":"van Lint","year":"1992"},{"key":"10.1016\/S0012-365X(99)90045-6_BIB22","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/jcd.3180010204","article-title":"The t-designs with prescribed automorphism group, new simple 6-designs","volume":"1","author":"Schmalz","year":"1993","journal-title":"J. Combin. Des."},{"key":"10.1016\/S0012-365X(99)90045-6_BIB23","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","article-title":"Congruent graphs and the connectivity of graphs","volume":"54","author":"Whitney","year":"1932","journal-title":"Amer. J. Math."},{"key":"10.1016\/S0012-365X(99)90045-6_BIB24","series-title":"Finite Permutation Groups","author":"Wielandt","year":"1964"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99900456?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99900456?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:22:18Z","timestamp":1553228538000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99900456"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":24,"alternative-id":["S0012365X99900456"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)90045-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}