Van der Waerden function and colorings of hypergraphs with large girth
From MaRDI portal
Publication:382207
DOI10.1134/S1064562413040388zbMath1310.05209MaRDI QIDQ382207
Publication date: 18 November 2013
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562413040388
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Roth's theorem on progressions
- Two combinatorial theorems on arithmetic progressions
- On the chromatic number of simple triangle-free triple systems
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- An application of Lovász' local lemma-A new lower bound for the van der Waerden number
- Notes on Number Theory II : On a theorem of van der Waerden
- Szemerédi's theorem and problems on arithmetic progressions
- A Construction for Partitions Which Avoid Long Arithmetic Progressions
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- A new proof of Szemerédi's theorem