Random Van der Waerden Theorem

Abstract

In this paper we prove the Random Van der Waerden Theorem: For q1 ≥ q2 ≥ …b ≥ qr ≥ 3 ∈ N there exist c,C >0 such that \[ n ∞ P([n]p → (q1,…c, qr)) = cases 1 & if p ≥ C · n-q2q1(q2-1), 0 & if p ≤ c · n-q2q1(q2-1), cases\] extending the results of R\"odl and Ruci\'nski for the symmetric case qi = q. The proof for the 1-statement is based on the Hypergraph Container Method by Balogh, Morris and Samotij and Saxton and Thomason. The proof for the 0-statement is an extension of R\"odl and Ruci\'nski's argument for the symmetric case.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…