Combinatorial Structures on van der Waerden sets
From MaRDI portal
Publication:5364262
DOI10.1017/S0963548314000868zbMath1371.05305arXiv1301.4297OpenAlexW3099101985MaRDI QIDQ5364262
Publication date: 4 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.4297
Cites Work
- Unnamed Item
- Unnamed Item
- A density version of the Carlson-Simpson theorem
- Parametrized partitions of products of finite sets
- A Ramsey theorem for trees
- Subsets of products of finite sets of positive upper density
- Elemental methods in ergodic Ramsey theory
- A Hardy field extension of Szemerédi's theorem
- Remarks on a Ramsey theory for trees
- On extremal problems of graphs and generalized graphs
- A variant of the density Hales–Jewett theorem
- Introduction to Ramsey Spaces (AM-174)
- A Partition Theorem for the Infinite Subtrees of a Tree
- On sets of integers containing k elements in arithmetic progression
- An ergodic IP polynomial Szemerédi theorem
- Markov Processes and Ramsey Theory for Trees
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- A new proof of Szemerédi's theorem
This page was built for publication: Combinatorial Structures on van der Waerden sets