{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:17:25Z","timestamp":1775081845446,"version":"3.50.1"},"reference-count":37,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T00:00:00Z","timestamp":1595376000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2020,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A celebrated theorem of Pippenger states that any almost regular hypergraph with small codegrees has an almost perfect matching. We show that one can find such an almost perfect matching which is \u2018pseudorandom\u2019, meaning that, for instance, the matching contains as many edges from a given set of edges as predicted by a heuristic argument.<\/jats:p>","DOI":"10.1017\/s0963548320000280","type":"journal-article","created":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T05:56:48Z","timestamp":1595397408000},"page":"868-885","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":16,"title":["Pseudorandom hypergraph matchings"],"prefix":"10.1017","volume":"29","author":[{"given":"Stefan","family":"Ehard","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Glock","sequence":"additional","affiliation":[]},{"given":"Felix","family":"Joos","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2020,7,22]]},"reference":[{"key":"S0963548320000280_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"S0963548320000280_ref23","volume":"233","author":"Keevash","year":"2015","journal-title":"A Geometric Theory for Hypergraph Matching"},{"key":"S0963548320000280_ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01196135"},{"key":"S0963548320000280_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300001796"},{"key":"S0963548320000280_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2008.02.011"},{"key":"S0963548320000280_ref20","unstructured":"[20] Keevash, P. (2014) The existence of designs.arXiv:1401.3665"},{"key":"S0963548320000280_ref6","unstructured":"[6] Ehard, S. , Glock, S. and Joos, F. (2019) A rainbow blow-up lemma for almost optimally bounded edge-colourings.arXiv:1907.09950"},{"key":"S0963548320000280_ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2016.02.001"},{"key":"S0963548320000280_ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107359949.008"},{"key":"S0963548320000280_ref4","doi-asserted-by":"publisher","DOI":"10.1112\/plms.12218"},{"key":"S0963548320000280_ref18","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199603)8:2<149::AID-RSA5>3.0.CO;2-Y"},{"key":"S0963548320000280_ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2008.10.002"},{"key":"S0963548320000280_ref22","first-page":"3099","article-title":"Hypergraph matchings and designs","volume":"3","author":"Keevash","year":"2018","journal-title":"Proc. Int. Cong. Math."},{"key":"S0963548320000280_ref21","unstructured":"[21] Keevash, P. (2018) The existence of designs II.arXiv:1802.05900"},{"key":"S0963548320000280_ref15","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20224"},{"key":"S0963548320000280_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5361-0"},{"key":"S0963548320000280_ref24","doi-asserted-by":"publisher","DOI":"10.1090\/tran\/7411"},{"key":"S0963548320000280_ref14","doi-asserted-by":"publisher","DOI":"10.1137\/080729657"},{"key":"S0963548320000280_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(85)80045-7"},{"key":"S0963548320000280_ref35","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(85)80023-8"},{"key":"S0963548320000280_ref17","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.0001"},{"key":"S0963548320000280_ref9","first-page":"1","article-title":"Packing Hamilton cycles in random and pseudo-random hypergraphs","volume":"41","author":"Freedman","year":"1975","journal-title":"Random Struct. Algorithms"},{"key":"S0963548320000280_ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14444-8_16"},{"key":"S0963548320000280_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01864160"},{"key":"S0963548320000280_ref10","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20396"},{"key":"S0963548320000280_ref12","unstructured":"[12] Glock, S. , K\u00fchn, D. , Lo, A. and Osthus, D. The existence of designs via iterative absorption: hypergraph F-designs for arbitrary F. Mem. Amer. Math. Soc., to appear."},{"key":"S0963548320000280_ref16","doi-asserted-by":"publisher","DOI":"10.4171\/JEMS\/909"},{"key":"S0963548320000280_ref31","doi-asserted-by":"publisher","DOI":"10.1112\/plms.12245"},{"key":"S0963548320000280_ref33","unstructured":"[33] Montgomery, R. , Pokrovskiy, A. and Sudakov, B. Embedding rainbow trees with applications to graph labelling and decomposition. J. Eur. Math. Soc., to appear."},{"key":"S0963548320000280_ref26","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-25.1.13"},{"key":"S0963548320000280_ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(89)90074-5"},{"key":"S0963548320000280_ref32","unstructured":"[32] Montgomery, R. , Pokrovskiy, A. and Sudakov, B. (2020) A proof of Ringel\u2019s conjecture.arXiv:2001.02665"},{"key":"S0963548320000280_ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.43"},{"key":"S0963548320000280_ref30","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<376::AID-RSA10>3.0.CO;2-0"},{"key":"S0963548320000280_ref7","unstructured":"[7] Ehard, S. and Joos, F. (2020) A short proof of the blow-up lemma for approximate decompositions.arXiv:2001.03506"},{"key":"S0963548320000280_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(81)80014-5"},{"key":"S0963548320000280_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-005-0628-x"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548320000280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T12:46:43Z","timestamp":1605098803000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548320000280\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,22]]},"references-count":37,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["S0963548320000280"],"URL":"https:\/\/doi.org\/10.1017\/s0963548320000280","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,22]]},"assertion":[{"value":"\u00a9 The Author(s), 2020. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}