Number of the records: 1
On the Geometric Ramsey Number of Outerplanar Graphs
- 1.
SYSNO ASEP 0479815 Document Type J - Journal Article R&D Document Type The record was not marked in the RIV Subsidiary J Článek ve WOS Title On the Geometric Ramsey Number of Outerplanar Graphs Author(s) Cibulka, J. (CZ)
Gao, P. (DE)
Krčál, Marek (UIVT-O)
Valla, T. (CZ)
Valtr, P. (CZ)Number of authors 5 Source Title Discrete & Computational Geometry. - : Springer - ISSN 0179-5376
Roč. 53, č. 1 (2015), s. 64-79Language eng - English Country US - United States Keywords minors ; Geometric Ramsey theory ; Outerplanar graph ; Ordered Ramsey theory ; Pathwidth UT WOS 000346774600005 EID SCOPUS 84925491730 DOI 10.1007/s00454-014-9646-x Annotation 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 and general case, respectively. We then apply similar methods to prove an upper bound on the Ramsey number of a path with ordered vertices. Workplace Institute of Computer Science Contact Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Year of Publishing 2018
Number of the records: 1