Ramsey numbers of ordered graphs (Q5919338)

Summary: An ordered graph is a pair \(\mathcal{G}=(G,\prec)\) where \(G\) is a graph and \(\prec\) is a total ordering of its vertices. The ordered Ramsey number \(\overline{R}(\mathcal{G})\) is the minimum number \(N\) such that every ordered complete graph with \(N\) vertices and with edges colored by two colors contains a monochromatic copy of \(\mathcal{G} \). In contrast with the case of unordered graphs, we show that there are arbitrarily large ordered matchings \(\mathcal{M}_n\) on \(n\) vertices for which \(\overline{R}(\mathcal{M}_n)\) is superpolynomial in \(n\). This implies that ordered Ramsey numbers of the same graph can grow superpolynomially in the size of the graph in one ordering and remain linear in another ordering. We also prove that the ordered Ramsey number \(\overline{R}(\mathcal{G})\) is polynomial in the number of vertices of \(\mathcal{G}\) if the bandwidth of \(\mathcal{G}\) is constant or if \(\mathcal{G}\) is an ordered graph of constant degeneracy and constant interval chromatic number. The first result gives a positive answer to a question of \textit{D. Conlon} et al. [J. Comb. Theory, Ser. B 122, 353--383 (2017; Zbl 1350.05085)]. For a few special classes of ordered paths, stars or matchings, we give asymptotically tight bounds on their ordered Ramsey numbers. For so-called monotone cycles we compute their ordered Ramsey numbers exactly. This result implies exact formulas for geometric Ramsey numbers of cycles introduced by \textit{G. Károlyi} et al. [Discrete Comput. Geom. 20, No. 3, 375--388 (1998; Zbl 0912.05046)].