Ordered Ramsey numbers of graphs with $m$ edges
Ordered Ramsey numbers of graphs with $m$ edges
Given a vertex-ordered graph $G$, the ordered Ramsey number $r_<(G)$ is the minimum integer $N$ such that every $2$-coloring of the edges of the complete ordered graph $K_N$ contains a monochromatic ordered copy of $G$. Motivated by a similar question posed by Erd\H{o}s and Graham in the unordered setting, we …