---
res:
  bibo_abstract:
  - 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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Josef
      foaf_name: Cibulka, Josef
      foaf_surname: Cibulka
  - foaf_Person:
      foaf_givenName: Pu
      foaf_name: Gao, Pu
      foaf_surname: Gao
  - foaf_Person:
      foaf_givenName: Marek
      foaf_name: Krcál, Marek
      foaf_surname: Krcál
      foaf_workInfoHomepage: http://www.librecat.org/personId=33E21118-F248-11E8-B48F-1D18A9856A87
  - foaf_Person:
      foaf_givenName: Tomáš
      foaf_name: Valla, Tomáš
      foaf_surname: Valla
  - foaf_Person:
      foaf_givenName: Pavel
      foaf_name: Valtr, Pavel
      foaf_surname: Valtr
  bibo_doi: 10.1007/s00454-014-9646-x
  bibo_issue: '1'
  bibo_volume: 53
  dct_date: 2014^xs_gYear
  dct_identifier:
  - UT:000346774600005
  dct_language: eng
  dct_publisher: Springer@
  dct_title: On the geometric ramsey number of outerplanar graphs@
...