Ordered Ramsey numbers

Given a labeled graph H with vertex set {1,2,…,n}, the ordered Ramsey number r<(H) is the minimum N such that every two-coloring of the edges of the complete graph on {1,2,…,N} contains a copy of H with vertices appearing in the same order as in H. The ordered Ramsey number of a labeled graph H is at least the Ramsey number r(H) and the two coincide for complete graphs. However, we prove that even for matchings there are labelings where the ordered Ramsey number is superpolynomial in the number of vertices. Among other results, we also prove a general upper bound on ordered Ramsey numbers which implies that there exists a constant c such that r<(H)≤r(H)clog2⁡n for any labeled graph H on vertex set {1,2,…,n}.