Erd?s-Szekeres theorem with forbidden order types |
| |
| Authors: | Gyula Ká rolyi,Jó zsef Solymosi |
| |
| Affiliation: | a Department of Algebra and Number Theory, Eötvös University, Pázmány P. sétány 1/C, Budapest H-1117, Hungary
b Department of Mathematics, University of British Columbia, 1984 Mathematics Road,Vancouver, BC, Canada V6T 1Z4 |
| |
| Abstract: | According to the classical Erd?s-Szekeres theorem, every sufficiently large set of points in general position in the plane contains a large subset in convex position. Parallel to the Erd?s-Hajnal problem in graph-Ramsey theory, we investigate how large such subsets must a configuration contain if it does not have any sub-configuration belonging to a fixed order type. |
| |
| Keywords: | Erd?s-Szekeres theorem Order type Ramsey theory Erd?s-Szekeres conjecture Combinatorial convexity |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
