Polynomial bounds on geometric Ramsey numbers of ladder graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10190538" target="_blank" >RIV/00216208:11320/13:10190538 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/13:00209358
Result on the web
<a href="http://dx.doi.org/10.1007/978-88-7642-475-5_28" target="_blank" >http://dx.doi.org/10.1007/978-88-7642-475-5_28</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-88-7642-475-5_28" target="_blank" >10.1007/978-88-7642-475-5_28</a>

Result language
angličtina
Original language name
Polynomial bounds on geometric Ramsey numbers of ladder graphs
Original language description
We prove that the geometric Ramsey numbers of the ladder graph on 2n vertices are bounded by O(n^3) and O(n^10), in the convex and general case, respectively. We also prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases.
Czech name
—
Czech description
—

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
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
The Seventh European Conference on Combinatorics, Graph Theory and Applications
ISBN
978-88-7642-474-8
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
171-176
Publisher name
Scuola Normale Superiore
Place of publication
Pisa, Italy
Event location
Pisa, Italy
Event date
Sep 9, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)