Erdős-Szekeres type Theorems for ordered uniform matchings

Abstract

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 edges. There are $\frac{1}{2}\left(\genfrac{}{}{0ex}{}{2r}{r}\right)$ different ways two edges may intertwine, called here patterns. Among them we identify $3^{r-1}$ collectable patterns $P$, which have the potential of appearing in arbitrarily large quantities called $P$-cliques. We prove an Erdős-Szekeres type result guaranteeing in every ordered $r$-uniform matching the presence of a $P$-clique of a prescribed size, for some collectable pattern $P$. In particular, in the diagonal case, one of the $P$-cliques must be of size $\hat{I}\text{c◯}\left(n^{3^{1-r}}\right)$. In addition, for each collectable pattern $P$ we show that the largest size of a $P$-clique in a random ordered $r$-uniform matching of size $n$ is, with high probability, $\hat{I}˜\left(n^{1/r}\right)$.