A strengthening of the Erdős-Szekeres theorem
From MaRDI portal
Publication:2065993
DOI10.1016/j.ejc.2021.103456zbMath1486.05303arXiv2006.03703OpenAlexW3214348012WikidataQ113875496 ScholiaQ113875496MaRDI QIDQ2065993
Mikhail Lavrov, Felix Christian Clemen, József Balogh, Emily A. Heath
Publication date: 13 January 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.03703
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The size Ramsey number of a directed path
- On the combinatorial problems which I would most like to see solved
- Monochromatic paths in random tournaments
- Lexicographic Ramsey theory
- The oriented size Ramsey number of directed paths
- On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness
- Ordered size Ramsey number of paths
- Erdős-Szekeres-type theorems for monotone paths and convex bodies
- On size Ramsey number of paths, trees, and circuits. I
- Two variants of the size Ramsey number
- On some Multicolor Ramsey Properties of Random Graphs
This page was built for publication: A strengthening of the Erdős-Szekeres theorem
