|
This article is cited in 4 scientific papers (total in 4 papers)
Van der Waerden's function and colourings of hypergraphs
D. A. Shabanov M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
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$.
Keywords:
van der Waerden's theorem, arithmetic progressions, hypergraph,
chromatic number.
Received: 09.12.2009
Citation:
D. A. Shabanov, “Van der Waerden's function and colourings of hypergraphs”, Izv. Math., 75:5 (2011), 1063–1091
Linking options:
https://www.mathnet.ru/eng/im4270https://doi.org/10.1070/IM2011v075n05ABEH002564 https://www.mathnet.ru/eng/im/v75/i5/p195
|
Statistics & downloads: |
Abstract page: | 993 | Russian version PDF: | 325 | English version PDF: | 19 | References: | 84 | First page: | 18 |
|