<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>On the geometric ramsey number of outerplanar graphs</title></titleInfo>


<note type="publicationStatus">published</note>



<name type="personal">
  <namePart type="given">Josef</namePart>
  <namePart type="family">Cibulka</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Pu</namePart>
  <namePart type="family">Gao</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Marek</namePart>
  <namePart type="family">Krcál</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">33E21118-F248-11E8-B48F-1D18A9856A87</identifier></name>
<name type="personal">
  <namePart type="given">Tomáš</namePart>
  <namePart type="family">Valla</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Pavel</namePart>
  <namePart type="family">Valtr</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">UlWa</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>

<name type="corporate">
  <namePart></namePart>
  <identifier type="local">HeEd</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>








<abstract lang="eng">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.</abstract>

<originInfo><publisher>Springer</publisher><dateIssued encoding="w3cdtf">2014</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Discrete &amp; Computational Geometry</title></titleInfo>
  <identifier type="arXiv">1310.7004</identifier>
  <identifier type="ISI">000346774600005</identifier><identifier type="doi">10.1007/s00454-014-9646-x</identifier>
<part><detail type="volume"><number>53</number></detail><detail type="issue"><number>1</number></detail><extent unit="pages">64 - 79</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<apa>Cibulka, J., Gao, P., Krcál, M., Valla, T., &amp;#38; Valtr, P. (2014). On the geometric ramsey number of outerplanar graphs. &lt;i&gt;Discrete &amp;#38; Computational Geometry&lt;/i&gt;. Springer. &lt;a href=&quot;https://doi.org/10.1007/s00454-014-9646-x&quot;&gt;https://doi.org/10.1007/s00454-014-9646-x&lt;/a&gt;</apa>
<ista>Cibulka J, Gao P, Krcál M, Valla T, Valtr P. 2014. On the geometric ramsey number of outerplanar graphs. Discrete &amp;#38; Computational Geometry. 53(1), 64–79.</ista>
<mla>Cibulka, Josef, et al. “On the Geometric Ramsey Number of Outerplanar Graphs.” &lt;i&gt;Discrete &amp;#38; Computational Geometry&lt;/i&gt;, vol. 53, no. 1, Springer, 2014, pp. 64–79, doi:&lt;a href=&quot;https://doi.org/10.1007/s00454-014-9646-x&quot;&gt;10.1007/s00454-014-9646-x&lt;/a&gt;.</mla>
<chicago>Cibulka, Josef, Pu Gao, Marek Krcál, Tomáš Valla, and Pavel Valtr. “On the Geometric Ramsey Number of Outerplanar Graphs.” &lt;i&gt;Discrete &amp;#38; Computational Geometry&lt;/i&gt;. Springer, 2014. &lt;a href=&quot;https://doi.org/10.1007/s00454-014-9646-x&quot;&gt;https://doi.org/10.1007/s00454-014-9646-x&lt;/a&gt;.</chicago>
<ieee>J. Cibulka, P. Gao, M. Krcál, T. Valla, and P. Valtr, “On the geometric ramsey number of outerplanar graphs,” &lt;i&gt;Discrete &amp;#38; Computational Geometry&lt;/i&gt;, vol. 53, no. 1. Springer, pp. 64–79, 2014.</ieee>
<ama>Cibulka J, Gao P, Krcál M, Valla T, Valtr P. On the geometric ramsey number of outerplanar graphs. &lt;i&gt;Discrete &amp;#38; Computational Geometry&lt;/i&gt;. 2014;53(1):64-79. doi:&lt;a href=&quot;https://doi.org/10.1007/s00454-014-9646-x&quot;&gt;10.1007/s00454-014-9646-x&lt;/a&gt;</ama>
<short>J. Cibulka, P. Gao, M. Krcál, T. Valla, P. Valtr, Discrete &amp;#38; Computational Geometry 53 (2014) 64–79.</short>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>1842</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-11T11:54:18Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-09-29T13:11:56Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
