---
_id: '1842'
abstract:
- lang: eng
  text: 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.
acknowledgement: Marek Krčál was supported by the ERC Advanced Grant No. 267165.
article_processing_charge: No
arxiv: 1
author:
- first_name: Josef
  full_name: Cibulka, Josef
  last_name: Cibulka
- first_name: Pu
  full_name: Gao, Pu
  last_name: Gao
- first_name: Marek
  full_name: Krcál, Marek
  id: 33E21118-F248-11E8-B48F-1D18A9856A87
  last_name: Krcál
- first_name: Tomáš
  full_name: Valla, Tomáš
  last_name: Valla
- first_name: Pavel
  full_name: Valtr, Pavel
  last_name: Valtr
citation:
  ama: Cibulka J, Gao P, Krcál M, Valla T, Valtr P. On the geometric ramsey number
    of outerplanar graphs. <i>Discrete &#38; Computational Geometry</i>. 2014;53(1):64-79.
    doi:<a href="https://doi.org/10.1007/s00454-014-9646-x">10.1007/s00454-014-9646-x</a>
  apa: Cibulka, J., Gao, P., Krcál, M., Valla, T., &#38; Valtr, P. (2014). On the
    geometric ramsey number of outerplanar graphs. <i>Discrete &#38; Computational
    Geometry</i>. Springer. <a href="https://doi.org/10.1007/s00454-014-9646-x">https://doi.org/10.1007/s00454-014-9646-x</a>
  chicago: Cibulka, Josef, Pu Gao, Marek Krcál, Tomáš Valla, and Pavel Valtr. “On
    the Geometric Ramsey Number of Outerplanar Graphs.” <i>Discrete &#38; Computational
    Geometry</i>. Springer, 2014. <a href="https://doi.org/10.1007/s00454-014-9646-x">https://doi.org/10.1007/s00454-014-9646-x</a>.
  ieee: J. Cibulka, P. Gao, M. Krcál, T. Valla, and P. Valtr, “On the geometric ramsey
    number of outerplanar graphs,” <i>Discrete &#38; Computational Geometry</i>, vol.
    53, no. 1. Springer, pp. 64–79, 2014.
  ista: Cibulka J, Gao P, Krcál M, Valla T, Valtr P. 2014. On the geometric ramsey
    number of outerplanar graphs. Discrete &#38; Computational Geometry. 53(1), 64–79.
  mla: Cibulka, Josef, et al. “On the Geometric Ramsey Number of Outerplanar Graphs.”
    <i>Discrete &#38; Computational Geometry</i>, vol. 53, no. 1, Springer, 2014,
    pp. 64–79, doi:<a href="https://doi.org/10.1007/s00454-014-9646-x">10.1007/s00454-014-9646-x</a>.
  short: J. Cibulka, P. Gao, M. Krcál, T. Valla, P. Valtr, Discrete &#38; Computational
    Geometry 53 (2014) 64–79.
date_created: 2018-12-11T11:54:18Z
date_published: 2014-11-14T00:00:00Z
date_updated: 2025-09-29T13:11:56Z
day: '14'
department:
- _id: UlWa
- _id: HeEd
doi: 10.1007/s00454-014-9646-x
external_id:
  arxiv:
  - '1310.7004'
  isi:
  - '000346774600005'
intvolume: '        53'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1310.7004
month: '11'
oa: 1
oa_version: Submitted Version
page: 64 - 79
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '5260'
scopus_import: '1'
status: public
title: On the geometric ramsey number of outerplanar graphs
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 53
year: '2014'
...