An Application of Lovász's Local Lemma - A New Lower Bound for the van der Waerden Number
暂无分享,去创建一个
The van der Waerden number W(n) is the smallest integer so that if we divide the integers {1,2, …, W(n)} into two classes, then at least one of them contains an arithmetic progression of length n. We prove in this paper that W(n) ≥ 2n/nϵ for all sufficiently large n. © 1990 Wiley Periodicals, Inc.
[1] E.R. Berlekamp. A Construction for Partitions Which Avoid Long Arithmetic Progressions , 1968, Canadian Mathematical Bulletin.
[2] József Beck. A Remark Concerning Arithmetic Progressions , 1980, J. Comb. Theory, Ser. A.
[3] Joel H. Spencer,et al. Asymptotic lower bounds for Ramsey functions , 1977, Discret. Math..
[4] P. Erdos-L Lovász. Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .