A Simple Proof of a Theorem of Erdös and Szekeres*
From MaRDI portal
Publication:3254802
DOI10.1112/jlms/s1-34.3.352zbMath0085.15003OpenAlexW2032917498WikidataQ29300078 ScholiaQ29300078MaRDI QIDQ3254802
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
Related Items (26)
Monotone subsequences in (0,1)-matrices ⋮ Transversals of total strict linear orders ⋮ Erdős-Szekeres without induction ⋮ Containment problems in high-dimensional spaces ⋮ The ritual origin of counting ⋮ Strictly monotonic multidimensional sequences and stable sets in pillage games ⋮ On unimodal subsequences ⋮ INTERLEAVING LOGIC AND COUNTING ⋮ Another look at the longest ascending subsequence problem ⋮ Erdős-Szekeres tableaux ⋮ Some Ramsey-type theorems ⋮ On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness ⋮ Angle orders and zeros ⋮ Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem ⋮ Monotonic subsequences in random sequences ⋮ Chi-boundedness of graph classes excluding wheel vertex-minors ⋮ Weak versions of Ramsey's theorem ⋮ Combinatorial generation via permutation languages. II. Lattice congruences ⋮ Representing point sets on the plane as permutations ⋮ Monochromatic paths and circuits in edge-colored graphs ⋮ Monotonic restrictions ⋮ Monotonicity ⋮ Angle orders ⋮ Protecting billiard balls from collisions ⋮ Achievement and avoidance games designed from theorems ⋮ Cross-monotone subsequences
This page was built for publication: A Simple Proof of a Theorem of Erdös and Szekeres*
