We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on 2n vertices are bounded by O(n3) and O(n10), in the convex and general case, respectively. We then apply similar methods to prove an (Formula presented.) upper bound on the Ramsey number of a path with n ordered vertices.
CITATION STYLE
Cibulka, J., Gao, P., Krčál, M., Valla, T., & Valtr, P. (2015). On the Geometric Ramsey Number of Outerplanar Graphs. Discrete and Computational Geometry, 53(1), 64–79. https://doi.org/10.1007/s00454-014-9646-x
Mendeley helps you to discover research relevant for your work.