{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:45:56Z","timestamp":1787319956956,"version":"build-2736575974"},"reference-count":10,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471257"],"award-info":[{"award-number":["11471257"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1600738"],"award-info":[{"award-number":["DMS-1600738"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1443894"],"award-info":[{"award-number":["CNS-1443894"]}],"id":[{"id":"10.13039\/100000001","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>The minimum codegree threshold for a perfect matching in a $k$-graph with $n$ vertices was determined by R\u00f6dl, Ruci\u0144ski, and Szemer\u00e9di for the case when $n\\equiv 0\\pmod k$. Recently, Han resolved the remaining cases when $n \\not\\equiv 0\\pmod k$, establishing a conjecture of R\u00f6dl, Ruci\u0144ski, and Szemer\u00e9di. In this paper, we determine the minimum codegree threshold for almost perfect matchings in $k$-partite $k$-graphs, answering a question of R\u00f6dl and Ruci\u0144ski.<\/jats:p>","DOI":"10.1137\/16m1097948","type":"journal-article","created":{"date-parts":[[2018,2,15]],"date-time":"2018-02-15T12:54:05Z","timestamp":1518699245000},"page":"522-533","source":"Crossref","is-referenced-by-count":3,"title":["Almost Perfect Matchings in $k$-Partite $k$-Graphs"],"prefix":"10.1137","volume":"32","author":[{"given":"Hongliang","family":"Lu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xingxing","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,2,15]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2008.02.011"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548314000613"},{"key":"atypb3","unstructured":"J. Han, C. Zang, and Y. Zhao,\n                      Matchings in $k$-Partite $k$-Uniform Hypergraphs\n                      , preprint,https:\/\/arxiv.org\/abs\/1611.00290, 2016."},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20139"},{"key":"atypb5","doi-asserted-by":"crossref","unstructured":"M. Mitzenmacher and E. Upfal,\n                      Probability and Computing: Randomized Algorithms and Probabilistic Analysis\n                      , Cambridge University Press, 2005.","DOI":"10.1017\/CBO9780511813603"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-008-0787-7"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2008.10.002"},{"key":"atypb8","first-page":"561","author":"Ro\u0308dl V.","year":"2010","journal-title":"Springer"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2012.04.006"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2013.04.008"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/16M1097948","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:54:06Z","timestamp":1787316846000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/16M1097948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/16M1097948"],"URL":"https:\/\/doi.org\/10.1137\/16m1097948","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}