{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T23:23:42Z","timestamp":1783985022445,"version":"3.55.0"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T00:00:00Z","timestamp":1722816000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T00:00:00Z","timestamp":1722816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s00493-024-00116-0","type":"journal-article","created":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T11:02:57Z","timestamp":1722855777000},"page":"1233-1266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Perfect Matchings in Random Sparsifications of Dirac Hypergraphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Dong Yeap","family":"Kang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom","family":"Kelly","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniela","family":"K\u00fchn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deryk","family":"Osthus","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vincent","family":"Pfenninger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,5]]},"reference":[{"key":"116_CR1","unstructured":"Allen, P., B\u00f6ttcher, J., Corsten, J., Davies, E., Jenssen, M., Morris, P., Roberts, B., Skokan, J.: A robust Corr\u00e1di\u2013Hajnal Theorem. arXiv:2209.01116 (2022)"},{"key":"116_CR2","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1016\/j.jcta.2012.02.004","volume":"119","author":"N Alon","year":"2012","unstructured":"Alon, N., Frankl, P., Huang, H., R\u00f6dl, V., Ruci\u0144ski, A., Sudakov, B.: Large matchings in uniform hypergraphs and the conjecture of Erd\u0151s and Samuels. J. Comb. Theory Ser. A 119, 1200\u20131215 (2012)","journal-title":"J. Comb. Theory Ser. A"},{"key":"116_CR3","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1137\/20M1375838","volume":"36","author":"Y Alon","year":"2022","unstructured":"Alon, Y., Krivelevich, M.: Hitting time of edge disjoint Hamilton cycles in random subgraph processes on dense base graphs. SIAM J. Discret. Math. 36, 728\u2013754 (2022)","journal-title":"SIAM J. Discret. Math."},{"key":"116_CR4","doi-asserted-by":"crossref","first-page":"795","DOI":"10.4007\/annals.2021.194.3.5","volume":"194","author":"R Alweiss","year":"2021","unstructured":"Alweiss, R., Lovett, S., Wu, K., Zhang, J.: Improved bounds for the sunflower lemma. Ann. Math. 194, 795\u2013815 (2021)","journal-title":"Ann. Math."},{"key":"116_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/rsa.20915","volume":"57","author":"B Barber","year":"2020","unstructured":"Barber, B., Glock, S., K\u00fchn, D., Lo, A., Montgomery, R., Osthus, D.: Minimalist designs. Random Struct. Algorithms 57, 47\u201363 (2020)","journal-title":"Random Struct. Algorithms"},{"key":"116_CR6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.aim.2015.09.032","volume":"288","author":"B Barber","year":"2016","unstructured":"Barber, B., K\u00fchn, D., Lo, A., Osthus, D.: Edge-decompositions of graphs with high minimum degree. Adv. Math. 288, 337\u2013385 (2016)","journal-title":"Adv. Math."},{"key":"116_CR7","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.jcta.2017.04.005","volume":"151","author":"B Barber","year":"2017","unstructured":"Barber, B., K\u00fchn, D., Lo, A., Osthus, D., Taylor, A.: Clique decompositions of multipartite graphs and completion of Latin squares. J. Comb. Theory Ser. A 151, 146\u2013201 (2017)","journal-title":"J. Comb. Theory Ser. A"},{"key":"116_CR8","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1137\/21M1430327","volume":"36","author":"Y Chang","year":"2022","unstructured":"Chang, Y., Ge, H., Han, J., Wang, G.: Matching of given sizes in hypergraphs. SIAM J. Discret. Math. 36, 2323\u20132338 (2022)","journal-title":"SIAM J. Discret. Math."},{"key":"116_CR9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/rsa.3240020208","volume":"2","author":"FRK Chung","year":"1991","unstructured":"Chung, F.R.K.: Regularity lemmas for hypergraphs and quasi-randomness. Random Struct. Algorithms 2, 241\u2013252 (1991)","journal-title":"Random Struct. Algorithms"},{"key":"116_CR10","unstructured":"Condon, P., Espuny\u00a0D\u00edaz, A., Gir\u00e3o, A., K\u00fchn, D., Osthus, D.: Hamiltonicity of random subgraphs of the hypercube. Mem. Am. Math. Soc. (to appear)"},{"key":"116_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0963548300001796","volume":"5","author":"C Cooper","year":"1996","unstructured":"Cooper, C., Frieze, A., Molloy, M., Reed, B.: Perfect matchings in random $$r$$-regular, $$s$$-uniform hypergraphs. Comb. Probab. Comput. 5, 1\u201314 (1996)","journal-title":"Comb. Probab. Comput."},{"key":"116_CR12","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. (3) 2, 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc. (3)"},{"key":"116_CR13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"116_CR14","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01894879","volume":"17","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the existence of a factor of degree one of a connected random graph. Acta Math. Acad. Sci. Hungar. 17, 359\u2013368 (1966)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"116_CR15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02579174","volume":"1","author":"P Erd\u0151s","year":"1981","unstructured":"Erd\u0151s, P.: On the combinatorial problems which I would most like to see solved. Combinatorica 1, 25\u201342 (1981)","journal-title":"Combinatorica"},{"key":"116_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-35.1.85","volume":"1","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Rado, R.: Intersection theorems for systems of sets. J. Lond. Math. Soc. 1, 85\u201390 (1960)","journal-title":"J. Lond. Math. Soc."},{"key":"116_CR17","unstructured":"Ferber, A., Hardiman, L., Mond, A.: Counting Hamiltonian cycles in Dirac hypergraphs. arXiv:2110.15475 (2021)"},{"key":"116_CR18","first-page":"135","volume":"7","author":"A Ferber","year":"2016","unstructured":"Ferber, A., Krivelevich, M., Sudakov, B.: Counting and packing Hamilton $$\\ell $$-cycles in dense hypergraphs. J. Comb. 7, 135\u2013157 (2016)","journal-title":"J. Comb."},{"key":"116_CR19","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.jctb.2022.02.009","volume":"155","author":"A Ferber","year":"2022","unstructured":"Ferber, A., Kwan, M.: Dirac-type theorems in random hypergraphs. J. Comb. Theory Ser. B 155, 318\u2013357 (2022)","journal-title":"J. Comb. Theory Ser. B"},{"key":"116_CR20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02351586","volume":"8","author":"P Frankl","year":"1992","unstructured":"Frankl, P., R\u00f6dl, V.: The uniformity lemma for hypergraphs. Graphs Comb. 8, 309\u2013312 (1992)","journal-title":"Graphs Comb."},{"key":"116_CR21","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/j.jctb.2022.08.002","volume":"157","author":"P Frankl","year":"2022","unstructured":"Frankl, P., Kupavskii, A.: The Erd\u0151s matching conjecture and concentration inequalities. J. Comb. Theory Ser. B 157, 366\u2013400 (2022)","journal-title":"J. Comb. Theory Ser. B"},{"key":"116_CR22","doi-asserted-by":"crossref","first-page":"475","DOI":"10.4007\/annals.2021.194.2.2","volume":"194","author":"K Frankston","year":"2021","unstructured":"Frankston, K., Kahn, J., Narayanan, B., Park, J.: Thresholds versus fractional expectation-thresholds. Ann. Math. 194, 475\u2013495 (2021)","journal-title":"Ann. Math."},{"key":"116_CR23","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1002\/rsa.3240070104","volume":"7","author":"A Frieze","year":"1995","unstructured":"Frieze, A., Janson, S.: Perfect matchings in random $$s$$-uniform hypergraphs. Random Struct. Algorithms 7, 41\u201357 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"116_CR24","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s004930050052","volume":"19","author":"A Frieze","year":"1999","unstructured":"Frieze, A., Kannan, R.: Quick approximation to matrices and applications. Combinatorica 19, 175\u2013220 (1999)","journal-title":"Combinatorica"},{"key":"116_CR25","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1017\/S0963548317000104","volume":"26","author":"W Gao","year":"2017","unstructured":"Gao, W., Han, J.: Minimum codegree threshold for $$C_6^3$$-factors in 3-uniform hypergraphs. Comb. Probab. Comput. 26, 536\u2013559 (2017)","journal-title":"Comb. Probab. Comput."},{"key":"116_CR26","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1017\/S096354831900021X","volume":"28","author":"W Gao","year":"2019","unstructured":"Gao, W., Han, J., Zhao, Y.: Codegree conditions for tiling complete $$k$$-partite $$k$$-graphs and loose cycles. Comb. Probab. Comput. 28, 840\u2013870 (2019)","journal-title":"Comb. Probab. Comput."},{"key":"116_CR27","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"116_CR28","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1002\/jgt.22650","volume":"97","author":"R Glebov","year":"2021","unstructured":"Glebov, R., Luria, Z., Simkin, M.: Perfect matchings in random subgraphs of regular bipartite graphs. J. Graph Theory 97, 208\u2013231 (2021)","journal-title":"J. Graph Theory"},{"key":"116_CR29","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1017\/S0963548320000619","volume":"30","author":"S Glock","year":"2021","unstructured":"Glock, S., Gould, S., Joos, F., K\u00fchn, D., Osthus, D.: Counting Hamilton cycles in Dirac hypergraphs. Comb. Probab. Comput. 30, 631\u2013653 (2021)","journal-title":"Comb. Probab. Comput."},{"key":"116_CR30","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.jctb.2019.02.010","volume":"139","author":"S Glock","year":"2019","unstructured":"Glock, S., K\u00fchn, D., Lo, A., Montgomery, R., Osthus, D.: On the decomposition threshold of a given graph. J. Comb. Theory Ser. B 139, 47\u2013127 (2019)","journal-title":"J. Comb. Theory Ser. B"},{"key":"116_CR31","first-page":"v+131","volume":"284","author":"S Glock","year":"2023","unstructured":"Glock, S., K\u00fchn, D., Lo, A., Osthus, D.: The existence of designs via iterative absorption: hypergraph $$F$$-designs for arbitrary $$F$$. Mem. Am. Math. Soc. 284, v+131 (2023)","journal-title":"Mem. Am. Math. Soc."},{"key":"116_CR32","unstructured":"Hajnal, A., Szemer\u00e9di, E.: Proof of a Conjecture of P. Erd\u0151s, Combinatorial Theory and Its Applications, II (Proceedings in Colloqisum, Balatonf\u00fcred, North-Holland, Amsterdam, pp. 601\u2013623 (1969)"},{"key":"116_CR33","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.jctb.2009.10.002","volume":"100","author":"H H\u00e0n","year":"2010","unstructured":"H\u00e0n, H., Schacht, M.: Dirac-type results for loose Hamilton cycles in uniform hypergraphs. J. Comb. Theory Ser. B 100, 332\u2013346 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"key":"116_CR34","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, 732\u2013748 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"116_CR35","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1017\/S0963548314000613","volume":"24","author":"J Han","year":"2015","unstructured":"Han, J.: Near perfect matchings in $$k$$-uniform hypergraphs. Comb. Probab. Comput. 24, 723\u2013732 (2015)","journal-title":"Comb. Probab. Comput."},{"key":"116_CR36","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1137\/15M1029990","volume":"30","author":"J Han","year":"2016","unstructured":"Han, J.: Near perfect matchings in $$k$$-uniform hypergraphs II. SIAM J. Discret. Math. 30, 1453\u20131469 (2016)","journal-title":"SIAM J. Discret. Math."},{"key":"116_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/rsa.20224","volume":"33","author":"A Johansson","year":"2008","unstructured":"Johansson, A., Kahn, J., Vu, V.: Factors in random graphs. Random Struct. Algorithms 33, 1\u201328 (2008)","journal-title":"Random Struct. Algorithms"},{"key":"116_CR38","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1002\/rsa.20916","volume":"57","author":"T Johansson","year":"2020","unstructured":"Johansson, T.: On Hamilton cycles in Erd\u0151s-R\u00e9nyi subgraphs of large graphs. Random Struct. Algorithms 57, 132\u2013149 (2020)","journal-title":"Random Struct. Algorithms"},{"key":"116_CR39","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1090\/tran\/8508","volume":"375","author":"J Kahn","year":"2022","unstructured":"Kahn, J.: Hitting times for Shamir\u2019s problem. Trans. Am. Math. Soc. 375, 627\u2013668 (2022)","journal-title":"Trans. Am. Math. Soc."},{"key":"116_CR40","doi-asserted-by":"crossref","DOI":"10.1016\/j.aim.2023.109019","volume":"422","author":"J Kahn","year":"2023","unstructured":"Kahn, J.: Asymptotics for Shamir\u2019s problem. Adv. Math. 422, 109019, 39 (2023)","journal-title":"Adv. Math."},{"key":"116_CR41","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1017\/S0963548307008474","volume":"16","author":"J Kahn","year":"2007","unstructured":"Kahn, J., Kalai, G.: Thresholds and expectation thresholds. Comb. Probab. Comput. 16, 495\u2013502 (2007)","journal-title":"Comb. Probab. Comput."},{"key":"116_CR42","first-page":"6623","volume":"376","author":"DY Kang","year":"2023","unstructured":"Kang, D.Y., Kelly, T., K\u00fchn, D., Methuku, A., Osthus, D.: Thresholds for Latin squares and Steiner triple systems: bounds within a logarithmic factor. Trans. Am. Math. Soc. 376, 6623\u20136662 (2023)","journal-title":"Trans. Am. Math. Soc."},{"key":"116_CR43","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Reducibility Among Combinatorial Problems. Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. Complexity of Computer Computations, pp. 85\u2013103. Springer, Berlin (1972)"},{"key":"116_CR44","first-page":"vi+95","volume":"233","author":"P Keevash","year":"2015","unstructured":"Keevash, P., Mycroft, R.: A geometric theory for hypergraph matching. Mem. Am. Math. Soc. 233, vi+95 (2015)","journal-title":"Mem. Am. Math. Soc."},{"key":"116_CR45","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1137\/10080796X","volume":"27","author":"I Khan","year":"2013","unstructured":"Khan, I.: Perfect matchings in 3-uniform hypergraphs with large vertex degree. SIAM J. Discret. Math. 27, 1021\u20131039 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"116_CR46","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/j.jctb.2015.09.005","volume":"116","author":"I Khan","year":"2016","unstructured":"Khan, I.: Perfect matchings in 4-uniform hypergraphs. J. Comb. Theory Ser. B 116, 333\u2013366 (2016)","journal-title":"J. Comb. Theory Ser. B"},{"key":"116_CR47","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s004930070014","volume":"20","author":"JH Kim","year":"2000","unstructured":"Kim, J.H., Vu, V.H.: Concentration of multivariate polynomials and its applications. Combinatorica 20, 417\u2013434 (2000)","journal-title":"Combinatorica"},{"key":"116_CR48","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1002\/rsa.20510","volume":"46","author":"F Knox","year":"2015","unstructured":"Knox, F., K\u00fchn, D., Osthus, D.: Edge-disjoint Hamilton cycles in random graphs. Random Struct. Algorithms 46, 397\u2013445 (2015)","journal-title":"Random Struct. Algorithms"},{"key":"116_CR49","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1017\/S0963548300001620","volume":"4","author":"J Koml\u00f3s","year":"1995","unstructured":"Koml\u00f3s, J., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: Proof of a packing conjecture of Bollob\u00e1s. Comb. Probab. Comput. 4, 241\u2013255 (1995)","journal-title":"Comb. Probab. Comput."},{"key":"116_CR50","doi-asserted-by":"crossref","first-page":"3095","DOI":"10.1090\/S0002-9947-2014-05963-1","volume":"366","author":"M Krivelevich","year":"2014","unstructured":"Krivelevich, M., Lee, C., Sudakov, B.: Robust Hamiltonicity of Dirac graphs. Trans. Am. Math. Soc. 366, 3095\u20133130 (2014)","journal-title":"Trans. Am. Math. Soc."},{"key":"116_CR51","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1002\/rsa.20508","volume":"46","author":"M Krivelevich","year":"2015","unstructured":"Krivelevich, M., Lee, C., Sudakov, B.: Long paths and cycles in random subgraphs of graphs with large minimum degree. Random Struct. Algorithms 46, 320\u2013345 (2015)","journal-title":"Random Struct. Algorithms"},{"key":"116_CR52","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, 269\u2013280 (2006)","journal-title":"J. Graph Theory"},{"key":"116_CR53","doi-asserted-by":"crossref","unstructured":"K\u00fchn, D., Osthus, D.: Embedding Large Subgraphs into Dense Graphs, Surveys in Combinatorics, London Mathematical Society, Lecture Note Series, vol. 365. Cambridge University Press, Cambridge, pp. 137\u2013167 (2009)","DOI":"10.1017\/CBO9781107325975.007"},{"key":"116_CR54","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.aim.2013.01.005","volume":"237","author":"D K\u00fchn","year":"2013","unstructured":"K\u00fchn, D., Osthus, D.: Hamilton decompositions of regular expanders: a proof of Kelly\u2019s conjecture for large tournaments. Adv. Math. 237, 62\u2013146 (2013)","journal-title":"Adv. Math."},{"key":"116_CR55","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. Comb. Theory Ser. B 103, 291\u2013305 (2013)","journal-title":"J. Comb. Theory Ser. B"},{"key":"116_CR56","unstructured":"Kwan, M., Sah, A., Sawhney, M., Simkin, M.: High-girth Steiner triple systems. arXiv:2201.04554 (2022)"},{"key":"116_CR57","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1137\/19M1300662","volume":"35","author":"H Lu","year":"2021","unstructured":"Lu, H., Yu, X., Yuan, X.: Nearly perfect matchings in uniform hypergraphs. SIAM J. Discret. Math. 35, 1022\u20131049 (2021)","journal-title":"SIAM J. Discret. Math."},{"key":"116_CR58","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1090\/jams\/1028","volume":"37","author":"J Park","year":"2024","unstructured":"Park, J., Pham, H.T.: A proof of the Kahn-Kalai conjecture. J. Am. Math. Soc. 37, 235\u2013243 (2024)","journal-title":"J. Am. Math. Soc."},{"key":"116_CR59","unstructured":"Pham, H.T., Sah, A., Sawhney, M., Simkin, M.: A toolkit for robust thresholds. arXiv:2210.03064 (2022)"},{"key":"116_CR60","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","volume":"14","author":"L P\u00f3sa","year":"1976","unstructured":"P\u00f3sa, L.: Hamiltonian circuits in random graphs. Discret. Math. 14, 359\u2013364 (1976)","journal-title":"Discret. Math."},{"key":"116_CR61","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), An Irregular Mind, Bolyai Society of Mathematical Studies, vol.\u00a021. J\u00e1nos Bolyai Mathematical Society, Budapest, pp. 561\u2013590 (2010)","DOI":"10.1007\/978-3-642-14444-8_16"},{"key":"116_CR62","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1016\/j.ejc.2006.05.008","volume":"27","author":"V R\u00f6dl","year":"2006","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: Perfect matchings in uniform hypergraphs with large minimum degree. Eur. J. Comb. 27, 1333\u20131349 (2006)","journal-title":"Eur. J. Comb."},{"key":"116_CR63","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. Comb. Theory Ser. A 116, 613\u2013636 (2009)","journal-title":"J. Comb. Theory Ser. A"},{"key":"116_CR64","first-page":"633","volume":"49","author":"V R\u00f6dl","year":"2008","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Schacht, M., Szemer\u00e9di, E.: A note on perfect matchings in uniform hypergraphs with large minimum collective degree. Comment. Math. Univ. Carolin. 49, 633\u2013636 (2008)","journal-title":"Comment. Math. Univ. Carolin."},{"key":"116_CR65","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s00493-008-2295-z","volume":"28","author":"V R\u00f6dl","year":"2008","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: An approximate Dirac-type theorem for $$k$$-uniform hypergraphs. Combinatorica 28, 229\u2013260 (2008)","journal-title":"Combinatorica"},{"key":"116_CR66","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1007\/s00039-023-00639-6","volume":"33","author":"A Sah","year":"2023","unstructured":"Sah, A., Sawhney, M., Simkin, M.: Threshold for Steiner triple systems. Geom. Funct. Anal. 33, 1141\u20131172 (2023)","journal-title":"Geom. Funct. Anal."},{"key":"116_CR67","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0012-365X(83)90044-4","volume":"45","author":"J Schmidt","year":"1983","unstructured":"Schmidt, J., Shamir, E.: A threshold for perfect matchings in random $$d$$-pure hypergraphs. Discret. Math. 45, 287\u2013295 (1983)","journal-title":"Discret. Math."},{"key":"116_CR68","unstructured":"Steger, A.: Die Kleitman\u2013Rothschild Methode, Ph.D. thesis, Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn (1990)"},{"key":"116_CR69","doi-asserted-by":"crossref","unstructured":"Sudakov, B.: Robustness of Graph Properties, Surveys in Combinatorics, London Mathematical Society, Lecture Note Series, vol. 440. Cambridge University Press, Cambridge, pp. 372\u2013408 (2017)","DOI":"10.1017\/9781108332699.009"},{"key":"116_CR70","doi-asserted-by":"crossref","unstructured":"Talagrand, M.: Are many small sets explicitly small? In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 13\u201336 (2010)","DOI":"10.1145\/1806689.1806693"},{"key":"116_CR71","doi-asserted-by":"crossref","unstructured":"Treglown, A., Zhao, Y.: A note on perfect matchings in uniform hypergraphs, Electron. J. Comb. 23, Paper 1.16, 14 (2016)","DOI":"10.37236\/5406"},{"key":"116_CR72","doi-asserted-by":"crossref","unstructured":"Zhao, Y.: Recent Advances on Dirac-Type Problems for Hypergraphs, Recent Trends in Combinatorics, IMA Volume in Mathematical Application, vol. 159. Springer, Cham., pp. 145\u2013165 (2016)","DOI":"10.1007\/978-3-319-24298-9_6"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00116-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-024-00116-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00116-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T14:03:51Z","timestamp":1731679431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-024-00116-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,5]]},"references-count":72,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["116"],"URL":"https:\/\/doi.org\/10.1007\/s00493-024-00116-0","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,5]]},"assertion":[{"value":"2 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflictsof interest to declare that are relevant to the content of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}