Upper Bounds for Ordered Ramsey Numbers of Small 1-Orderings

Kevin Chang

A $k$-ordering of a graph $G$ assigns distinct order-labels from the set $\{1,\dots ,|G|\}$ to $k$ vertices in $G$. Given a $k$-ordering $H$, the ordered Ramsey number $R_{<}(H)$ is…