{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T12:01:37Z","timestamp":1790683297673,"version":"4.1.0"},"reference-count":47,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2014\/18641-5"],"award-info":[{"award-number":["2014\/18641-5"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/03447-6"],"award-info":[{"award-number":["2013\/03447-6"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>In this paper we study some variants of Dirac-type problems in hypergraphs. First, we show that for $k\\ge 3$, if $H$ is a $k$-graph on $n\\in k\\mathbb N$ vertices with independence number at most $n\/p$ and minimum codegree at least $(1\/p+o(1))n$, where $p$ is the smallest prime factor of $k$, then $H$ contains a perfect matching. Second, we show that if $H$ is a 3-graph on $n\\in 3\\mathbb N$ vertices which does not contain any induced copy of $K_4^-$ (the unique 3-graph with 4 vertices and 3 edges) and has minimum codegree at least $(1\/3+o(1)))n$, then $H$ contains a perfect matching. Moreover, if we allow the matching to miss at most 3 vertices, then the minimum degree condition can be reduced to $(1\/6+o(1)))n$. Third, we show that if $H$ is a 3-graph on $n\\in 4\\mathbb N$ vertices which does not contain any induced copy of $K_4^-$ and has minimum codegree at least $(1\/8+o(1)))n$, then $H$ contains a perfect $Y$-tiling, where $Y$ represents the unique 3-graph with 4 vertices and 2 edges. We also provide the examples showing that our minimum codegree conditions are asymptotically best possible. Our main tool for finding the perfect matching is a characterization theorem in [J. Han, Trans. Amer. Math. Soc., 369 (2017), pp. 5197--5218] that characterizes the $k$-graphs with minimum codegree at least $n\/k$ which contain a perfect matching.<\/jats:p>","DOI":"10.1137\/17m1128046","type":"journal-article","created":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T14:09:31Z","timestamp":1524751771000},"page":"919-932","source":"Crossref","is-referenced-by-count":3,"title":["On Perfect Matchings and Tilings in Uniform Hypergraphs"],"prefix":"10.1137","volume":"32","author":[{"given":"Jie","family":"Han","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,4,26]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2012.02.004"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20670"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01895727"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21726"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"A. Czygrinow and V. Kamat,\n                      Tight co-degree condition for perfect matchings in 4-graphs\n                      , Electron. J. Combin., 19 (2), paper 20, 16, 2012.","DOI":"10.37236\/2338"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579235"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548317000104"},{"key":"atypb11","unstructured":"W. Gao, J. Han, and Y. Zhao,\n                      Codegree conditions for tiling complete $k$-partite $k$-graphs and loose cycles\n                      , preprint,arXiv:1612.07247, 2016."},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1959.11989408"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/080729657"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1137\/15M1029990"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1137\/16M1056079"},{"key":"atypb16","unstructured":"J. Han,\n                      The complexity of perfect packings in dense graphs\n                      , in Theory and Applications of Models of Computation: 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings, T. V. Gopal, G. Ja\u0308ger, and S. Steila, eds., Springer International, Cham, Switzerland, 2017, pp. 289-303."},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1090\/tran\/6999"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548317000268"},{"key":"atypb19","unstructured":"J. Han and A. Treglown,\n                      The complexity of perfect matchings and packings in dense hypergraphs\n                      , preprint,arXiv:1609.06147, 2016."},{"key":"atypb20","unstructured":"J. Han, C. Zang, and Y. Zhao,\n                      Matchings in $k$-partite $k$-graphs\n                      , preprint,arXiv:1611.00290, 2016."},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2017.02.003"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21833"},{"key":"atypb23","doi-asserted-by":"crossref","unstructured":"S. Janson, T. \u0141uczak, and A. Rucinski,\n                      Random Graphs\n                      , Wiley Ser. Discrete Math. Optim., Wiley-Interscience, New York, 2000.","DOI":"10.1002\/9781118032718"},{"key":"atypb24","first-page":"85","author":"Karp R. M.","year":"1972","journal-title":"New York"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2014.10.009"},{"key":"atypb26","first-page":"1098","volume":"233","author":"Keevash P.","year":"2015","journal-title":"Mem. Amer. Math. Soc."},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1137\/10080796X"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2015.09.005"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2006.02.004"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20139"},{"key":"atypb31","first-page":"137","author":"Ku\u0308hn D.","year":"2009","journal-title":"UK"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2012.11.005"},{"key":"atypb33","first-page":"257","volume":"17","author":"Vergnas M. Las","year":"1975","journal-title":"Cahiers Centre E\u0301tudes Recherche Ope\u0301r."},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2012.12.005"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-014-1410-8"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2011.02.001"},{"key":"atypb37","first-page":"283","volume":"7","author":"Moon J. W.","year":"1962","journal-title":"Magyar Tud. Akad. Mat. Kutato\u0301 Int. Ko\u0308zl."},{"key":"atypb38","doi-asserted-by":"crossref","unstructured":"R. Mycroft,\n                      Packing $k$-partite $k$-uniform hypergraphs\n                      , J. Combin. Theory Ser. A, 138 (2016), pp. 60-132.","DOI":"10.1016\/j.jcta.2015.09.007"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-008-0787-7"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2011.03.006"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1137\/090747476"},{"key":"atypb42","first-page":"561","volume":"21","author":"Ro\u0308dl V.","year":"2010","journal-title":"Math. Studies"},{"key":"atypb43","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2006.05.008"},{"key":"atypb44","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2008.10.002"},{"key":"atypb45","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1090\/S0002-9939-1974-0323648-6","volume":"42","author":"Sumner D. P.","year":"1974","journal-title":"Proc. Amer. Math. Soc."},{"key":"atypb46","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2012.04.006"},{"key":"atypb47","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2013.04.008"},{"key":"atypb48","doi-asserted-by":"crossref","first-page":"P1","DOI":"10.37236\/5406","volume":"23","author":"Treglown A.","year":"2016","journal-title":"Electron. J. Combin."},{"key":"atypb49","doi-asserted-by":"crossref","unstructured":"Y. Zhao,\n                      Recent advances on Dirac-type problems for hypergraphs\n                      , in Recent Trends in Combinatorics, IMA Vol. Math. Appl. 159, Springer, New York, 2016.","DOI":"10.1007\/978-3-319-24298-9_6"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1128046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:05:33Z","timestamp":1787317533000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1128046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/17M1128046"],"URL":"https:\/\/doi.org\/10.1137\/17m1128046","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}