{"OA_type":"gold","volume":13,"department":[{"_id":"MaKw"}],"_id":"19433","ddc":["510"],"citation":{"ieee":"M. Anastos, Z. Jin, M. A. Kwan, and B. Sudakov, “Extremal, enumerative and probabilistic results on ordered hypergraph matchings,” <i>Forum of Mathematics, Sigma</i>, vol. 13. Cambridge University Press, 2025.","ista":"Anastos M, Jin Z, Kwan MA, Sudakov B. 2025. Extremal, enumerative and probabilistic results on ordered hypergraph matchings. Forum of Mathematics, Sigma. 13, e55.","mla":"Anastos, Michael, et al. “Extremal, Enumerative and Probabilistic Results on Ordered Hypergraph Matchings.” <i>Forum of Mathematics, Sigma</i>, vol. 13, e55, Cambridge University Press, 2025, doi:<a href=\"https://doi.org/10.1017/fms.2024.144\">10.1017/fms.2024.144</a>.","ama":"Anastos M, Jin Z, Kwan MA, Sudakov B. Extremal, enumerative and probabilistic results on ordered hypergraph matchings. <i>Forum of Mathematics, Sigma</i>. 2025;13. doi:<a href=\"https://doi.org/10.1017/fms.2024.144\">10.1017/fms.2024.144</a>","apa":"Anastos, M., Jin, Z., Kwan, M. A., &#38; Sudakov, B. (2025). Extremal, enumerative and probabilistic results on ordered hypergraph matchings. <i>Forum of Mathematics, Sigma</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/fms.2024.144\">https://doi.org/10.1017/fms.2024.144</a>","chicago":"Anastos, Michael, Zhihan Jin, Matthew Alan Kwan, and Benny Sudakov. “Extremal, Enumerative and Probabilistic Results on Ordered Hypergraph Matchings.” <i>Forum of Mathematics, Sigma</i>. Cambridge University Press, 2025. <a href=\"https://doi.org/10.1017/fms.2024.144\">https://doi.org/10.1017/fms.2024.144</a>.","short":"M. Anastos, Z. Jin, M.A. Kwan, B. Sudakov, Forum of Mathematics, Sigma 13 (2025)."},"isi":1,"publication":"Forum of Mathematics, Sigma","quality_controlled":"1","date_published":"2025-03-14T00:00:00Z","external_id":{"arxiv":["2308.12268"],"isi":["001444429200001"]},"oa":1,"publication_status":"published","acknowledgement":"We would like to thank Timo Seppäläinen for some illuminating discussion about random high-dimensional orders and for bringing our attention to [59]. We would also like to thank the referees for helpful feedback. Michael Anastos is supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 101034413. Matthew Kwan is supported by ERC Starting Grant ‘RANDSTRUCT’ No. 101076777, also funded by the European Union. Zhihan Jin and Benny Sudakov are supported by SNSF grant 200021-228014.","article_processing_charge":"Yes","author":[{"id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb","first_name":"Michael","last_name":"Anastos","full_name":"Anastos, Michael"},{"full_name":"Jin, Zhihan","first_name":"Zhihan","last_name":"Jin"},{"full_name":"Kwan, Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567","last_name":"Kwan","first_name":"Matthew Alan"},{"first_name":"Benny","last_name":"Sudakov","full_name":"Sudakov, Benny"}],"publisher":"Cambridge University Press","license":"https://creativecommons.org/licenses/by/4.0/","day":"14","type":"journal_article","arxiv":1,"project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program"},{"grant_number":"101076777","name":"Randomness and structure in combinatorics","_id":"bd95085b-d553-11ed-ba76-e55d3349be45"}],"has_accepted_license":"1","month":"03","article_number":"e55","status":"public","abstract":[{"lang":"eng","text":"An ordered r-matching is an r-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of r-dimensional orders. The theory of ordered 2-matchings is well developed and has connections and applications to extremal and enumerative combinatorics, probability and geometry. On the other hand, in the case  r≥3 much less is known, largely due to a lack of powerful bijective tools. Recently, Dudek, Grytczuk and Ruciński made some first steps towards a general theory of ordered r-matchings, and in this paper we substantially improve several of their results and introduce some new directions of study. Many intriguing open questions remain."}],"year":"2025","article_type":"original","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file_date_updated":"2025-04-03T11:24:35Z","date_created":"2025-03-20T12:59:14Z","ec_funded":1,"publication_identifier":{"issn":["2050-5094"]},"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"success":1,"file_name":"2025_ForumMathSigma_Anastos.pdf","content_type":"application/pdf","relation":"main_file","file_id":"19468","date_created":"2025-04-03T11:24:35Z","access_level":"open_access","creator":"dernst","checksum":"f396270ad78c1ed67095c8e5a66fca26","date_updated":"2025-04-03T11:24:35Z","file_size":630297}],"corr_author":"1","title":"Extremal, enumerative and probabilistic results on ordered hypergraph matchings","oa_version":"Published Version","date_updated":"2025-09-30T11:18:57Z","intvolume":"        13","OA_place":"publisher","language":[{"iso":"eng"}],"doi":"10.1017/fms.2024.144","scopus_import":"1"}