Some Ordered Ramsey Numbers of Graphs on Four Vertices

Will Overman, Jeremy F. Alm, Kayla Coffey +1

An ordered graph $H$ on $n$ vertices is a graph whose vertices have been labeled bijectively with $\{1,...,n\}$. The ordered Ramsey number $r_{<}(H)$ is the minimum $n$ such that eve…