Mostra el registre d'ítem simple
Ramsey numbers for empty convex polygons
dc.contributor.author | Bautista-Santiago, Crevel |
dc.contributor.author | Cano, Javier |
dc.contributor.author | Fabila-Monroy, Ruy |
dc.contributor.author | Hidalgo-Toscano, Carlos |
dc.contributor.author | Huemer, Clemens |
dc.contributor.author | Leaños, Jesús |
dc.contributor.author | Sakai, Toshinori |
dc.contributor.author | Urrutia, Jorge |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2016-04-12T11:19:04Z |
dc.date.issued | 2015 |
dc.identifier.citation | Bautista-Santiago, C., Cano, J., Fabila-Monroy, R., Hidalgo-Toscano, C., Huemer, C., Leaños, J., Sakai, T., Urrutia, J. Ramsey numbers for empty convex polygons. A: European Workshop on Computational Geometry. "European Workshop on Computational Geometry EuroCG 2015". University of Ljubljana, 2015, p. 169-171. |
dc.identifier.uri | http://hdl.handle.net/2117/85553 |
dc.description.abstract | We study a geometric Ramsey type problem where the vertices of the complete graph Kn are placed on a set S of n points in general position in the plane, and edges are drawn as straight-line segments. We define the empty convex polygon Ramsey number REC (k, k) as the smallest number n such that for every set S of n points and for every two-coloring of the edges of Kn drawn on S, at least one color class contains an empty convex k-gon. A polygon is empty if it contains no points from S in its interior. We prove 17 ≤ REC (3, 3) ≤ 463 and 57 ≤ REC (4, 4). Further, there are three-colorings of the edges of Kn (drawn on a set S) without empty monochromatic triangles. A related Ramsey number for islands in point sets is also studied. |
dc.format.extent | 3 p. |
dc.language.iso | eng |
dc.publisher | University of Ljubljana |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística |
dc.subject.lcsh | Combinatorics |
dc.subject.lcsh | Graph theory |
dc.title | Ramsey numbers for empty convex polygons |
dc.type | Conference report |
dc.subject.lemac | Grafs, Teoria de |
dc.contributor.group | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.relation.publisherversion | http://eurocg15.fri.uni-lj.si/pub/eurocg15-book-of-abstracts.pdf |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 17377441 |
dc.description.version | Postprint (author's final draft) |
dc.date.lift | 10000-01-01 |
local.citation.author | Bautista-Santiago, C.; Cano, J.; Fabila-Monroy, R.; Hidalgo-Toscano, C.; Huemer, C.; Leaños, J.; Sakai, T.; Urrutia, J. |
local.citation.contributor | European Workshop on Computational Geometry |
local.citation.publicationName | European Workshop on Computational Geometry EuroCG 2015 |
local.citation.startingPage | 169 |
local.citation.endingPage | 171 |