Author:
Brown Tom,Landman Bruce M.,Robertson Aaron
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. A construction for partitions which avoid long arithmetic progressions;Berlekamp;Canad. Math. Bull.,1968
2. On sparse sets hitting linear forms;Chung,2002
3. Satisfiability and computing van der Waerden numbers;Dransfield;Electron. J. Combin.,2004
4. Combinatorial theorems on classifications of subsets of a given set;Erdős;Proc. London Math. Soc.,1952
5. F. Everts, Colorings of sets, PhD thesis, University of Colorado, 1977
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献