{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T12:29:09Z","timestamp":1772368149212,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,6,1]],"date-time":"1979-06-01T00:00:00Z","timestamp":297043200000},"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":12465,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1979,6]]},"DOI":"10.1016\/0095-8956(79)90002-9","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"276-294","source":"Crossref","is-referenced-by-count":26,"title":["The edge-coloring of complete hypergraphs I"],"prefix":"10.1016","volume":"26","author":[{"given":"Zsolt","family":"Baranyai","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(79)90002-9_BIB1","article-title":"Das Turnierproblem f\u00fcr Spiele zu je dreien","author":"Peltesohn","year":"1936","journal-title":"Inaugural dissertation"},{"key":"10.1016\/0095-8956(79)90002-9_BIB2","series-title":"Linear inequalities and related systems","first-page":"223","article-title":"Integral boundary points of convex polyhedra","author":"Hoffman","year":"1956"},{"key":"10.1016\/0095-8956(79)90002-9_BIB3","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/S0021-9800(66)80024-8","article-title":"On separating systems of a finite set","volume":"1","author":"Katona","year":"1966","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0095-8956(79)90002-9_BIB4","series-title":"Combinatorial Programming: Methods and Applications","first-page":"337","article-title":"A few remarks on chromatic scheduling","author":"de Werra","year":"1975"},{"key":"10.1016\/0095-8956(79)90002-9_BIB5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0095-8956(72)90054-8","article-title":"A Simple Proof of the Erd\u00f6s-Chao Ko-Rado Theorem","volume":"13","author":"Katona","year":"1972","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0095-8956(79)90002-9_BIB6","series-title":"Combinatorics, 18\u201337, Proc. Conference Oxford","article-title":"Sperner-type theorems of finite sets","author":"Brace","year":"1972"},{"key":"10.1016\/0095-8956(79)90002-9_BIB7","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1112\/jlms\/s2-4.3.489","article-title":"Chromatic numbers for certain graphs","volume":"4","author":"Laskar","year":"1972","journal-title":"J. London Math. Soc. (2)"},{"key":"10.1016\/0095-8956(79)90002-9_BIB8","series-title":"A Survey of Combinatorial Theory","first-page":"361","article-title":"The existence of resolvable block designs","author":"Ray-Chaudhuri","year":"1973"},{"key":"10.1016\/0095-8956(79)90002-9_BIB9","author":"Berge","year":"1973"},{"key":"10.1016\/0095-8956(79)90002-9_BIB10","article-title":"Investigations in the Theory of Blocking Paris of Polyhedra","author":"Weinberger","year":"1973"},{"key":"10.1016\/0095-8956(79)90002-9_BIB11","unstructured":"D. B. Weinberger, Network flows, minimum coverings and the four-color conjecture."},{"key":"10.1016\/0095-8956(79)90002-9_BIB12","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0012-365X(76)90039-X","article-title":"On decomposition of r-partite graphs into edge-disjoint Hamilton circuits","volume":"14","author":"Laskar","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(79)90002-9_BIB13","series-title":"Infinite and finite sets","first-page":"159","article-title":"On good k-colourings of a hypergraph","author":"Berge","year":"1975"},{"key":"10.1016\/0095-8956(79)90002-9_BIB14","unstructured":"Z. Baranyai, On the factorisation of the complete uniform hypergraph, Ref. [13, pp. 91\u2013108]."},{"key":"10.1016\/0095-8956(79)90002-9_BIB15","article-title":"A Generalization of Baranyai's Theorem","author":"Brouwer","year":"1976","journal-title":"Mathematics Centre Report ZW 81\/76"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895679900029?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895679900029?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T16:25:14Z","timestamp":1548779114000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895679900029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,6]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,6]]}},"alternative-id":["0095895679900029"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(79)90002-9","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1979,6]]}}}