Erdős-Szekeres theorem for multidimensional arrays
From MaRDI portal
Publication:6172693
DOI10.4171/jems/1262zbMath1518.05193arXiv1910.13318WikidataQ113691983 ScholiaQ113691983MaRDI QIDQ6172693
No author found.
Publication date: 20 July 2023
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.13318
Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items
Cites Work
- Unnamed Item
- Twins in words and long common subsequences in permutations
- Monotonicity
- Some nonstandard Ramsey like applications
- Canonizing ordering theorems for Hales Jewett structures
- Some remarks on natural orders for combinatorial cubes
- Combinatorial problems on the existence of large submatrices. I
- Monotone subsequences in any dimension
- Finite three-dimensional partial orders which are not sphere orders
- Statistics of orderings
- Lexicographic Ramsey theory
- Partition problems in high dimensional boxes
- Edge-ordered Ramsey numbers
- Monochromatic paths in edge-colored graphs
- A Ramsey-type problem in directed and bipartite graphs
- A Multidimensional Generalization of the Erdős–Szekeres Lemma on Monotone Subsequences
- On edge‐ordered Ramsey numbers
- The complexity of temporal constraint satisfaction problems
- Monotone Subsequences in High-Dimensional Permutations
- An Upper Bound on Zarankiewicz' Problem
- Subfunction Structure
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Monotonic Subsequences
- Ordered Ramsey numbers
- Ramsey numbers of sparse hypergraphs
- On a theorem of Erdős and Szekeres
