Extremal, enumerative and probabilistic results on ordered hypergraph matchings
arXiv:2308.12268 · doi:10.1017/fms.2024.144
Abstract
An ordered -matching is an -uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of -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 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 -matchings, and in this paper we substantially improve several of their results and introduce some new directions of study. Many intriguing open questions remain.
arXiv comment35 pages
References in corpus (8)
- Erdos-Szekeres-type theorems for monotone paths and convex bodies
- Erdos-Szekeres-type statements: Ramsey function and decidability in dimension 1
- A unified Erdős-Pósa theorem for constrained cycles
- Limiting distribution of maximal crossing and nesting of Poissonized random matchings
- The length of an s-increasing sequence of r-tuples
- Tight paths in convex geometric hypergraphs
- Monotone Subsequences in High-Dimensional Permutations
- A growth model in multiple dimensions and the height of a random partial order