A Simple Proof of a Theorem of Erdös and Szekeres*

DOI10.1112/JLMS/S1-34.3.352MaRDI QIDQ3254802zbMATH OpenOpenAlexWikidataFDO

Authors A. Seidenberg

Publication date 1959

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s1-34.3.352

zbMATH Keywords

elementary geometry

Cited in

(28)

• Cross-monotone subsequences
• Monotone subsequences in (0,1)-matrices
• The ritual origin of counting
• On unimodal subsequences
• Another look at the longest ascending subsequence problem
• Some Ramsey-type theorems
• Angle orders and zeros
• Monotonic subsequences in random sequences
• Weak versions of Ramsey's theorem
• Containment problems in high-dimensional spaces
• Combinatorial generation via permutation languages. II. Lattice congruences
• Representing point sets on the plane as permutations
• Transversals of total strict linear orders
• On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness
• Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
• Monochromatic paths and circuits in edge-colored graphs
• Erdős-Szekeres without induction
• Achievement and avoidance games designed from theorems
• Erdős-Szekeres tableaux
• Strictly monotonic multidimensional sequences and stable sets in pillage games
• INTERLEAVING LOGIC AND COUNTING
• Catalan Numbers and Permutations
• Saturation results around the Erdős-Szekeres problem
• On an Erdős-Szekeres game
• Monotonic restrictions
• Monotonicity
• Angle orders
• Protecting billiard balls from collisions

This page was built for publication: A Simple Proof of a Theorem of Erdös and Szekeres^*

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3254802)