Monochromatic progressions in random colorings

From MaRDI portal
Publication:412191

DOI10.1016/J.JCTA.2012.01.010zbMATH Open1239.05075arXiv1106.0793OpenAlexW1963997033MaRDI QIDQ412191FDOQ412191


Authors: S. Vijay Edit this on Wikidata


Publication date: 4 May 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: Let N^{+}(k)= 2^{k/2} k^{3/2} f(k) and N^{-}(k)= 2^{k/2} k^{1/2} g(k) where 1=o(f(k)) and g(k)=o(1). We show that the probability of a random 2-coloring of {1,2,...,N^{+}(k)} containing a monochromatic k-term arithmetic progression approaches 1, and the probability of a random 2-coloring of {1,2,...,N^{-}(k)} containing a monochromatic k-term arithmetic progression approaches 0, for large k. This improves an upper bound due to Brown, who had established an analogous result for N^{+}(k)= 2^k log k f(k).


Full work available at URL: https://arxiv.org/abs/1106.0793




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Monochromatic progressions in random colorings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412191)