Ordered Ramsey numbers of loose paths and matchings

Christopher Cox, Derrick Stolee

For a $k$-uniform hypergraph $G$ with vertex set $\{1,\dots ,n\}$, the ordered Ramsey number ${\mathrm{OR}}_t(G)$ is the least integer $N$ such that every $t$-coloring of the e…