{"publication":"Discrete & Computational Geometry","date_created":"2018-12-11T11:54:18Z","volume":53,"page":"64 - 79","month":"11","date_updated":"2021-01-12T06:53:33Z","_id":"1842","title":"On the geometric ramsey number of outerplanar graphs","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"date_published":"2014-11-14T00:00:00Z","author":[{"first_name":"Josef","last_name":"Cibulka","full_name":"Cibulka, Josef"},{"first_name":"Pu","last_name":"Gao","full_name":"Gao, Pu"},{"id":"33E21118-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","full_name":"Krcál, Marek","last_name":"Krcál"},{"first_name":"Tomáš","last_name":"Valla","full_name":"Valla, Tomáš"},{"first_name":"Pavel","last_name":"Valtr","full_name":"Valtr, Pavel"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1310.7004"}],"status":"public","day":"14","type":"journal_article","year":"2014","oa":1,"oa_version":"Submitted Version","citation":{"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.","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>","short":"J. Cibulka, P. Gao, M. Krcál, T. Valla, P. Valtr, Discrete &#38; Computational Geometry 53 (2014) 64–79.","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>."},"publication_status":"published","scopus_import":1,"doi":"10.1007/s00454-014-9646-x","acknowledgement":"Marek Krčál was supported by the ERC Advanced Grant No. 267165.","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","intvolume":"        53","publisher":"Springer","publist_id":"5260","abstract":[{"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.","lang":"eng"}],"issue":"1","language":[{"iso":"eng"}]}