Ramsey Problems for Monotone Paths in Graphs and Hypergraphs

Abstract The study of ordered Ramsey numbers of monotone paths for graphs and hypergraphs has a long history, going back to the celebrated work by Erdős and Szekeres in the early days of Ramsey theory. In this paper we obtain several results in this area, establishing two conjectures of Mubayi and Suk and improving bounds due to Balko, Cibulka, Král and Kynčl. For example, in the graph case, we show that the ordered Ramsey number for a fixed clique versus a fixed power of a monotone path of length n is always linear in n . Also, in the 3-graph case, we show that the ordered Ramsey number for a fixed clique versus a tight monotone path of length n is always polynomial in n . As a by-product, we also obtain a color-monotone version of the well-known Canonical Ramsey Theorem of Erdős and Rado, which could be of independent interest.