{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T14:24:30Z","timestamp":1784557470032,"version":"3.55.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,3,20]],"date-time":"2014-03-20T00:00:00Z","timestamp":1395273600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s00373-014-1410-8","type":"journal-article","created":{"date-parts":[[2014,3,19]],"date-time":"2014-03-19T10:39:19Z","timestamp":1395225559000},"page":"679-712","source":"Crossref","is-referenced-by-count":51,"title":["$$F$$ F -Factors in Hypergraphs Via Absorption"],"prefix":"10.1007","volume":"31","author":[{"given":"Allan","family":"Lo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Klas","family":"Markstr\u00f6m","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,3,20]]},"reference":[{"key":"1410_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Spencer, J.H.: The probabilistic method, 2nd edn. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience [John Wiley & Sons], New York, 2000. With an appendix on the life and work of Paul Erd\u0151s","DOI":"10.1002\/0471722154"},{"key":"1410_CR2","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF01895727","volume":"14","author":"K Corr\u00e1di","year":"1963","unstructured":"Corr\u00e1di, K., Hajnal, A.: On the maximal number of independent circuits in a graph. Acta Math. Acad. Sci. Hungar. 14, 423\u2013439 (1963)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"1410_CR3","doi-asserted-by":"crossref","unstructured":"Czygrinow, A., DeBiasio, L., Nagle, B.: Tiling 3-uniform hypergraphs with $$K_4^3-2e.$$ K 4 3 - 2 e . J. Graph Theory 75, 124\u2013136 (2014). Arxiv, preprint arXiv:1108.4140","DOI":"10.1002\/jgt.21726"},{"issue":"3","key":"1410_CR4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2(3), 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1410_CR5","unstructured":"Duke, R.A., Lefmann, H., R\u00f6dl, V.: On uncrowded hypergraphs. In: Proceedings of the Sixth International Seminar on Random Graphs and Probabilistic Methods in Combinatorics and Computer Science, \u201cRandom Graphs \u201993\u201d (Pozna\u0144, 1993), vol. 6, pp. 209\u2013212 (1995)"},{"key":"1410_CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02759942","volume":"2","author":"P Erd\u0151s","year":"1964","unstructured":"Erd\u0151s, P.: On extremal problems of graphs and generalized graphs. Isr. J. Math. 2, 183\u2013190 (1964)","journal-title":"Isr. J. Math."},{"issue":"2","key":"1410_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF02579292","volume":"3","author":"P Erd\u0151s","year":"1983","unstructured":"Erd\u0151s, P., Simonovits, M.: Supersaturated graphs and hypergraphs. Combinatorica 3(2), 181\u2013192 (1983)","journal-title":"Combinatorica"},{"issue":"2","key":"1410_CR8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01200754","volume":"15","author":"DA Grable","year":"1995","unstructured":"Grable, D.A., Phelps, K.T., R\u00f6dl, V.: The minimum independence number for designs. Combinatorica 15(2), 175\u2013185 (1995)","journal-title":"Combinatorica"},{"key":"1410_CR9","unstructured":"Hajnal, A., Szemer\u00e9di, E.: Proof of a Conjecture of P. Erd\u0151s. In: Combinatorial Theory and Its Applications, II (Proc. Colloq., Balatonf\u00fcred, 1969), vol. 1970, pp. 601\u2013623. North-Holland, Amsterdam (1969)"},{"issue":"2","key":"1410_CR10","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1137\/080729657","volume":"23","author":"H H\u00e0n","year":"2009","unstructured":"H\u00e0n, H., Person, Y., Schacht, M.: On perfect matchings in uniform hypergraphs with large minimum vertex degree. SIAM J. Discret. Math. 23(2), 732\u2013748 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"1410_CR11","unstructured":"Keevash, P., Mycroft, R.: A geometric theory for hypergraph matching. Mem. Am. Math. Soc. (2011, to appear). arXiv:1108.1757"},{"key":"1410_CR12","doi-asserted-by":"crossref","unstructured":"Khan, I.: Perfect matching in 3 uniform hypergraphs with large vertex degree. SIAM J. Discret. Math. 27, 1021\u20131039 (2013)","DOI":"10.1137\/10080796X"},{"key":"1410_CR13","unstructured":"Khan, I.: Perfect matchings in 4-uniform hypergraphs (2011). ArXiv e-prints"},{"key":"1410_CR14","unstructured":"Kierstead, H., Mubayi, D.: Toward a Hajnal\u2013Szemeredi theorem for hypergraphs (2010). Arxiv, preprint arXiv:1005.4079"},{"issue":"2","key":"1410_CR15","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/rsa.1020","volume":"19","author":"A Kostochka","year":"2001","unstructured":"Kostochka, A., Mubayi, D., R\u00f6dl, V., Tetali, P.: On the chromatic number of set systems. Random Struct. Algorithms 19(2), 87\u201398 (2001)","journal-title":"Random Struct. Algorithms"},{"issue":"6","key":"1410_CR16","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.jctb.2006.02.004","volume":"96","author":"D K\u00fchn","year":"2006","unstructured":"K\u00fchn, D., Osthus, D.: Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. J. Combin. Theory Ser. B 96(6), 767\u2013821 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"1410_CR17","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/jgt.20139","volume":"51","author":"D K\u00fchn","year":"2006","unstructured":"K\u00fchn, D., Osthus, D.: Matchings in hypergraphs of large minimum degree. J. Graph Theory 51(4), 269\u2013280 (2006)","journal-title":"J. Graph Theory"},{"key":"1410_CR18","doi-asserted-by":"crossref","unstructured":"K\u00fchn, D., Osthus, D.: Embedding large subgraphs into dense graphs. In: Surveys in Combinatorics 2009. London Mathematical Society Lecture Note Series, vol. 365, pp. 137\u2013167. Cambridge Univ. Press, Cambridge (2009)","DOI":"10.1017\/CBO9781107325975.007"},{"issue":"2","key":"1410_CR19","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.jctb.2012.11.005","volume":"103","author":"D K\u00fchn","year":"2013","unstructured":"K\u00fchn, D., Osthus, D., Treglown, A.: Matchings in 3-uniform hypergraphs. J. Combin. Theory Ser. B 103(2), 291\u2013305 (2013)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"1410_CR20","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1017\/S096354831200048X","volume":"22","author":"A Lo","year":"2012","unstructured":"Lo, A., Markstr\u00f6m, K.: A multipartite version of the Hajnal\u2013Szemer\u00e9di theorem for graphs and hypergraphs. Combin. Probab. Comput. 22(1), 97\u2013111 (2012)","journal-title":"Combin. Probab. Comput."},{"issue":"3","key":"1410_CR21","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1016\/j.jcta.2012.12.005","volume":"120","author":"A Lo","year":"2013","unstructured":"Lo, A., Markstr\u00f6m, K.: Minimum codegree threshold for $$(K_4^3-e)$$ ( K 4 3 - e ) -factors. J. Combin. Theory Ser. A 120(3), 708\u2013721 (2013)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"4","key":"1410_CR22","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s00373-008-0787-7","volume":"24","author":"O Pikhurko","year":"2008","unstructured":"Pikhurko, O.: Perfect matchings and $$K^{3}_{4}$$ K 4 3 -tilings in hypergraphs of large codegree. Graphs Combin. 24(4), 391\u2013404 (2008)","journal-title":"Graphs Combin."},{"key":"1410_CR23","doi-asserted-by":"crossref","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A.: Dirac-type questions for hypergraphs\u2014a survey (or more problems for Endre to solve). In: An Irregular Mind (Szemer\u00e9di is 70), vol. 21. Bolyai Soc. Math. Studies (2010)","DOI":"10.1007\/978-3-642-14444-8_16"},{"issue":"3","key":"1410_CR24","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1016\/j.jcta.2008.10.002","volume":"116","author":"V R\u00f6dl","year":"2009","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Combin. Theory Ser. A 116(3), 613\u2013636 (2009)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1","key":"1410_CR25","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cosrev.2007.07.002","volume":"1","author":"R Yuster","year":"2007","unstructured":"Yuster, R.: Combinatorial and computational aspects of graph packing and graph decomposition. Comput. Sci. Rev. 1(1), 12\u201326 (2007)","journal-title":"Comput. Sci. Rev."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1410-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1410-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1410-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:37Z","timestamp":1559055577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1410-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,20]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["1410"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1410-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,20]]}}}