On the Geometric Ramsey Number of Outerplanar Graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10286127" target="_blank" >RIV/00216208:11320/15:10286127 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/15:00221639
Result on the web
<a href="http://dx.doi.org/10.1007/s00454-014-9646-x" target="_blank" >http://dx.doi.org/10.1007/s00454-014-9646-x</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00454-014-9646-x" target="_blank" >10.1007/s00454-014-9646-x</a>

Result language
angličtina
Original language name
On the Geometric Ramsey Number of Outerplanar Graphs
Original language description
We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth- outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on vertices are bounded by and , in the convex andgeneral case, respectively. We then apply similar methods to prove an upper bound on the Ramsey number of a path with ordered vertices.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)