Colouring versus density in integers and Hales-Jewett cubes
From MaRDI portal
Publication:6641568
DOI10.1112/jlms.12987MaRDI QIDQ6641568
Marcelo Tadeu Sales, Vojtěch Rödl, Christian Reiher
Publication date: 20 November 2024
Published in: Journal of the London Mathematical Society. Second Series (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new proof of the density Hales-Jewett theorem
- A quantitative ergodic theory proof of Szemerédi's theorem
- On Ramsey families of sets
- Induced restricted Ramsey theorems for spaces
- Quantitative theorems for regular systems of equations
- An ergodic Szemerédi theorem for commuting transformations
- Mathematics of Ramsey theory. Collected papers of the Prague symposium on graph theory held in Prague, Czechoslovakia
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- Beweis einer Baudetschen Vermutung.
- A density version of the Hales-Jewett theorem
- On a problem of formal logic.
- Hypergraph regularity and the multidimensional Szemerédi theorem
- On some sequences of integers.
- A Simple Proof of the Density Hales–Jewett Theorem
- Graph Theory and Probability
- Regularity and Positional Games
- On sets of integers containing k elements in arithmetic progression
- On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
- Arithmetic characterizations of Sidon sets
- Regularity Lemma for k-uniform hypergraphs
- The counting lemma for regular k‐uniform hypergraphs
- On chromatic number of graphs and set-systems
- On chromatic number of finite set-systems
- Note on Combinatorial Analysis
- A new proof of Szemerédi's theorem
This page was built for publication: Colouring versus density in integers and Hales-Jewett cubes
