Ramsey numbers of ordered graphs

DOI10.37236/7816MaRDI QIDQ5919338zbMATH OpenOpenAlexFDO

Authors Martin Balko, Josef Cibulka, Karel Král, Jan Kynčl

Publication date 17 January 2020

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i1p16

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Review text

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)].

Recommendations

Cites work

Cited in

(43)

Describes a project that uses

Uses Software

Glucose

This page was built for publication: Ramsey numbers of ordered graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919338)