Author:
Landman Bruce M.,Greenwell Raymond N.
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. Berlekamp, E.R.: A construction for partitions which avoid long arithmetic progressions. Canad. Math. Bull.11, 409–414 (1968)
2. Graham, R.L., Rothschild, B.L.: A short proof of van der Waerden's Theorem on arithmetic progressions. Proc. Amer. Math. Soc.42, 385–386 (1974)
3. Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory. New York: John Wiley and Sons 1980
4. Greenwell, R.N., Landman, B.M.: On the existence of a reasonable upper bound for the van der Waerden numbers. J. Comb. Theory (A), to appear
5. Landman, B.M.: Generalized van der Waerden numbers. Graphs and Combinatorics2, 351–356 (1986)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献