Some notes on the Erdős-Szekeres theorem

DOI10.1016/0012-365X(90)90232-7zbMath0769.52014MaRDI QIDQ1182859

P. Dierker, Arie Bialostocki, B. Voxman

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Erdős-Szekeres theoremRamsey numbersgeneral positionconvex \(n\)- gon

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Other problems of combinatorial convexity (52A37)

Related Items (11)

On weighted sums of numbers of convex polygons in point sets ⋮ Drawing the almost convex set in an integer grid of minimum size ⋮ Zero-sum problems -- a survey ⋮ On the generalized Erdös-Szekeres conjecture -- a new upper bound ⋮ Chromatic variants of the Erdős--Szekeres theorem on points in convex position. ⋮ The Erdős-Szekeres theorem and congruences ⋮ Highly connected monochromatic subgraphs ⋮ On the Erdős-Szekeres \(n\)-interior-point problem ⋮ Around Erdős-Szekeres problems ⋮ On Erdős-Szekeres-type problems ⋮ The Erdos-Szekeres problem on points in convex position – a survey

Cites Work

• Unnamed Item
• Combinatorial set theory: Partition relations for cardinals
• Extremal problems concerning transformations of the set of edges of the complete graph
• Konvexe Fünfecke in ebenen Punktmengen
• Extremal problems concerning transformations of the edges of the complete hypergraphs
• On the structure of set-mappings
• Sets with No Empty Convex 7-Gons

This page was built for publication: Some notes on the Erdős-Szekeres theorem