Author:
LeSaulnier Timothy D.,Vijay Sujith
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference3 articles.
1. On permutations containing no long arithmetic progressions;Davis;Acta Arithmetica,1977
2. P. Erdős, R.L. Graham, Old and new problems and results in combinatorial number theory, in: L’Enseignment Mathematique, Monograph No. 28, Geneva, 1980.
3. Enumerating permutations that avoid three term arithmetic progressions;Sharma;Electronic Journal of Combinatorics,2009
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献