Remarks on a Ramsey theory for trees
From MaRDI portal
Publication:2392039
DOI10.1007/s00493-012-2763-3zbMath1289.05452arXiv1107.5301OpenAlexW2006563044MaRDI QIDQ2392039
József Solymosi, Gábor Tardos, János Pach
Publication date: 6 August 2013
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.5301
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Randomized algorithms (68W20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (5)
Arithmetic subtrees in large subsets of products of trees ⋮ Direct and inverse results for popular differences in trees of positive dimension ⋮ Combinatorial Structures on van der Waerden sets ⋮ A density version of the Carlson-Simpson theorem ⋮ Measurable events indexed by products of trees
Cites Work
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- A density version of the Hales-Jewett theorem
- Set-polynomials and polynomial extension of the Hales-Jewett theorem
- Markov Processes and Ramsey Theory for Trees
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- On Some Sequences of Integers
- A new proof of Szemerédi's theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Remarks on a Ramsey theory for trees