---
res:
  bibo_abstract:
  - 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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Michael
      foaf_name: Anastos, Michael
      foaf_surname: Anastos
      foaf_workInfoHomepage: http://www.librecat.org/personId=0b2a4358-bb35-11ec-b7b9-e3279b593dbb
  - foaf_Person:
      foaf_givenName: Zhihan
      foaf_name: Jin, Zhihan
      foaf_surname: Jin
  - foaf_Person:
      foaf_givenName: Matthew Alan
      foaf_name: Kwan, Matthew Alan
      foaf_surname: Kwan
      foaf_workInfoHomepage: http://www.librecat.org/personId=5fca0887-a1db-11eb-95d1-ca9d5e0453b3
    orcid: 0000-0002-4003-7567
  - foaf_Person:
      foaf_givenName: Benny
      foaf_name: Sudakov, Benny
      foaf_surname: Sudakov
  bibo_doi: 10.1017/fms.2024.144
  bibo_volume: 13
  dct_date: 2025^xs_gYear
  dct_identifier:
  - UT:001444429200001
  dct_isPartOf:
  - http://id.crossref.org/issn/2050-5094
  dct_language: eng
  dct_publisher: Cambridge University Press@
  dct_title: Extremal, enumerative and probabilistic results on ordered hypergraph
    matchings@
...