Ramsey numbers of cliques versus monotone paths
From MaRDI portal
Publication:6201899
DOI10.1016/j.ejc.2024.103922arXiv2303.16995MaRDI QIDQ6201899
Publication date: 26 March 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.16995
Erdős-Szekeres monotone subsequence theoremmonochromatic blue increasing path \(P_n\)monochromatic red \(s\)-clique
Cites Work
- Unnamed Item
- Unnamed Item
- Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems
- Off-diagonal hypergraph Ramsey numbers
- Turan's theorem for \(k\)-graphs
- A decomposition theorem for partially ordered sets
- Erdős-Szekeres-type theorems for monotone paths and convex bodies
- Partition relations for cardinal numbers
- Some remarks on the theory of graphs
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Ordered Ramsey numbers
- Ramsey numbers of ordered graphs
- Diagonal Ramsey via effective quasirandomness