Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference17 articles.
1. On the number of permutations avoiding a given pattern;Alon;J. Combin. Theory Ser. A,2000
2. R. Arratia, On the Stanley–Wilf conjecture for the number of permutations avoiding a given pattern, Electron. J. Combin. 6(1) 1999 1–4, http://www.combinatorics.org/Volume_6/Abstracts/v6i1n1.html.
3. An extremal problem on sparse 0-1 matrices;Bienstock;SIAM J. Discrete Math.,1991
4. M. Bóna, Exact and asymptotic enumeration of permutations with subsequence conditions, Ph.D. Thesis, MIT, Cambridge, MA, 1997.
5. The solution of a conjecture of Stanley and Wilf for all layered patterns;Bóna;J. Combin. Theory Ser. A,1999
Cited by
184 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献