Funder
National Security Agency
National Science Foundation
Division of Mathematical Sciences
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference21 articles.
1. Rooted forests that avoid sets of permutations;Anders;Eur. J. Comb.,2018
2. Wilf-equivalence for singleton classes;Backelin;Adv. Appl. Math.,2007
3. Varieties of increasing trees;Bergeron,1992
4. Wilf equivalence relations for consecutive patterns;Dwyer;Adv. Appl. Math.,2018
5. Consecutive patterns in permutations;Elizalde;Adv. Appl. Math.,2003
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献