Van der Waerden's function and colourings of hypergraphs
| Autor: | Shabanov, Dmitrii A |
|---|---|
| Zdroj: | Izvestiya: Mathematics; October 2011, Vol. 75 Issue: 5 p1063-1091, 29p |
| Abstrakt: | A classical problem of combinatorial number theory is to compute van der Waerden's function $ W(n,r)$. Using random colourings of hypergraphs, we get a new asymptotic lower bound for $ W(n,r)$ which improves previous results for a wide range of values of $ n$ and $ r$. |
| Databáze: | Supplemental Index |
| Externí odkaz: |
|