Ramsey numbers and monotone colorings
From MaRDI portal
Publication:1713498
DOI10.1016/j.jcta.2018.11.013zbMath1403.05154arXiv1905.06000OpenAlexW2901033936WikidataQ114162699 ScholiaQ114162699MaRDI QIDQ1713498
Publication date: 25 January 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.06000
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Curves in \(\mathbb R^d\) intersecting every hyperplane at most \(d+1\) times
- Coding and counting arrangements of pseudolines
- Semispaces of configurations, cell complexes of arrangements
- Ordered Ramsey theory and track representations of graphs
- Axioms and hulls
- On the number of arrangements of pseudolines
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
- Higher Bruhat orders and cyclic hyperplane arrangements
- Higher-order Erdős-Szekeres theorems
- Erdős-Szekeres-type theorems for monotone paths and convex bodies
- Ramsey-type results for semi-algebraic relations
- A NOTE ON ORDER‐TYPE HOMOGENEOUS POINT SETS
- Lower bounds on geometric Ramsey functions
- Sums of Powers of Integers
- Some remarks on the theory of graphs
- Ramsey numbers of ordered graphs
- Ordered Ramsey numbers
- Sweeps, arrangements and signotopes
This page was built for publication: Ramsey numbers and monotone colorings
