Two combinatorial theorems on arithmetic progressions
From MaRDI portal
Cited in
(9)- A new lower bound for van der Waerden numbers
- Some new van der Waerden numbers
- Colourings of uniform hypergraphs with large girth and applications
- Arithmetic Progressions and Tic-Tac-Toe Games
- The Mathematical Work of Wolfgang Schmidt
- On the lower bound for the van der Waerden function
- Van der Waerden function and colorings of hypergraphs with large girth
- On partitioning integers into progression free sets
- Values and bounds for Ramsey numbers associated with polynomial iteration
This page was built for publication: Two combinatorial theorems on arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q774715)