Chromatic variants of the Erdös-Szekeres theorem on points in convex position

Authors:
Olivier Devillers;Ferran Hurtado;Gyula Károlyi;Carlos Seara
Affiliations:
INRIA, BP93, 06902 Sophia-Antipolis, France;Department Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain;Institute for Operations Research, Department of Mathematics, ETH Zurich, CH-8092 Zurich, Switzerland;Department Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain
Venue:
Computational Geometry: Theory and Applications
Year:
2003

Citing 11
Cited 2

Disjoint simplices and geometric hypergraphs

Proceedings of the third international conference on Combinatorial mathematics
Some notes on the Erdős-Szekeres theorem

Discrete Mathematics
Sets in R d with no large empty convex subsets

Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
The colored Tverberg's problem and complexes of injective functions

Journal of Combinatorial Theory Series A
On a partition into convex polygons

Discrete Applied Mathematics
Ramsey-remainder

European Journal of Combinatorics
On the generalized Erdős-Skekeres conjecture—a new upper bound

Discrete Mathematics
A Ramsey property of order types

Journal of Combinatorial Theory Series A
Ramsey-remainder for convex sets and the Erdős—Szekeres theorem

Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
On the number of disjoint convex quadrilaterals for a planar point set

Computational Geometry: Theory and Applications
Problems and Results around the Erdös-Szekeres Convex Polygon Theorem

JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry

Empty monochromatic triangles

Computational Geometry: Theory and Applications
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems related to the Erdös-Szekeres theorem about subsets of S in convex position, when additional chromatic constraints are considered.