Erdős-Szekeres type Theorems for ordered uniform matchings

Andrzej Dudek, Jarosław Grytczuk, Andrzej Ruciński

For $r,n\ge 2$, an ordered $r$-uniform matching of size $n$ is an $r$-uniform hypergraph on a linearly ordered vertex set $V$, with $|V|=rn$, consisting of $n$ pairwise disjoint edg…