{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T15:20:09Z","timestamp":1777044009465,"version":"3.51.4"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,12,9]],"date-time":"2017-12-09T00:00:00Z","timestamp":1512777600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s00493-017-3396-3","type":"journal-article","created":{"date-parts":[[2017,12,9]],"date-time":"2017-12-09T03:37:04Z","timestamp":1512790624000},"page":"1309-1335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Extending Factorizations of Complete Uniform Hypergraphs"],"prefix":"10.1007","volume":"38","author":[{"given":"M.","family":"Amin Bahmanian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Newman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,9]]},"reference":[{"key":"3396_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(80)90136-3","volume":"31","author":"L. D. Andersen","year":"1980","unstructured":"L. D. Andersen and A. J. W. Hilton: Generalized Latin rectangles, II, Embedding, Discrete Math.\n                           31 (1980), 235\u2013260.","journal-title":"Discrete Math."},{"key":"3396_CR2","unstructured":"A. Bahmanian and M. Newman: Embedding factorizations for 3-uniform hypergraphs II: r-factorizations into s-factorizations, Electron. J. Combin.\n                           23 (2016), paper 2.42, 14."},{"key":"3396_CR3","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/jgt.21669","volume":"73","author":"A. Bahmanian","year":"2013","unstructured":"A. Bahmanian and C. Rodger: Embedding factorizations for 3-uniform hypergraphs, J. Graph Theory\n                           73 (2013), 216\u2013224.","journal-title":"J. Graph Theory"},{"key":"3396_CR4","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1017\/S0963548312000041","volume":"21","author":"M. A. Bahmanian","year":"2012","unstructured":"M. A. Bahmanian: Detachments of hypergraphs I: The Berge-Johnson problem, Combin. Probab. Comput.\n                           21 (2012), 483\u2013495.","journal-title":"Combin. Probab. Comput."},{"key":"3396_CR5","volume-title":"Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erd\u0144s on his 60th birthday), Vol. I, 91\u2013108. Colloq. Math. Soc. J\u00e1nos Bolyai, Vol. 10.","author":"Zs. Baranyai","year":"1975","unstructured":"Zs. Baranyai: On the factorization of the complete uniform hypergraph, in: Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erd\u0144s on his 60th birthday), Vol. I, 91\u2013108. Colloq. Math. Soc. J\u00e1nos Bolyai, Vol. 10. North-Holland, Amsterdam, 1975."},{"key":"3396_CR6","volume-title":"Extension Of Colourings Of The Edges Of A Complete","author":"Zs. Baranyai","year":"1977","unstructured":"Zs. Baranyai and A. E. Brouwer: Extension Of Colourings Of The Edges Of A Complete (uniform Hyper)graph, CWI Technical Report ZW 91\/77, 1977."},{"key":"3396_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511662102","volume-title":"Parallelisms of complete designs","author":"P. J. Cameron","year":"1976","unstructured":"P. J. Cameron: Parallelisms of complete designs, Cambridge University Press, Cambridge-New York-Melbourne, 1976. London Mathematical Society Lecture Note Series, No. 23."},{"key":"3396_CR8","first-page":"215","volume-title":"Combinatorics, Paul Erd\u0151s is eighty, Vol. 1, Bolyai Soc. Math. Stud.","author":"R. H\u00e4ggkvist","year":"1993","unstructured":"R. H\u00e4ggkvist and T. Hellgren: Extensions of edge-colourings in hypergraphs, I, in: Combinatorics, Paul Erd\u0151s is eighty, Vol. 1, Bolyai Soc. Math. Stud., 215\u2013238. J\u00e1nos Bolyai Math. Soc., Budapest, 1993."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-017-3396-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3396-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3396-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T10:24:14Z","timestamp":1549880654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-017-3396-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,9]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["3396"],"URL":"https:\/\/doi.org\/10.1007\/s00493-017-3396-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,9]]},"assertion":[{"value":"27 January 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}