k-noncrossing and k-nonnesting graphs and fillings of ferrers diagrams
Author:
- 1 November 2007
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 27 (6) , 699-720
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Wilf-equivalence for singleton classesAdvances in Applied Mathematics, 2007
- Dyck paths and pattern-avoiding matchingsEuropean Journal of Combinatorics, 2007
- Crossings and nestings of matchings and partitionsTransactions of the American Mathematical Society, 2006
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapesAdvances in Applied Mathematics, 2006
- Distribution of Crossings, Nestings and Alignments of Two Edges in Matchings and PartitionsThe Electronic Journal of Combinatorics, 2006
- On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in MatchingsSIAM Journal on Discrete Mathematics, 2006
- Decreasing Subsequences in Permutations and Wilf Equivalence for InvolutionsJournal of Algebraic Combinatorics, 2005
- Generalized triangulations and diagonal-free subsets of stack polyominoesJournal of Combinatorial Theory, Series A, 2005
- A New Class of Wilf-Equivalent PermutationsJournal of Algebraic Combinatorics, 2002
- Counting Pattern-free Set Partitions II: Noncrossing and Other HypergraphsThe Electronic Journal of Combinatorics, 2000