Structure and Enumeration of (3+1)-Free Posets
- 22 November 2014
- journal article
- Published by Springer Nature in Annals of Combinatorics
- Vol. 18 (4) , 645-674
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Counting -avoiding permutationsEuropean Journal of Combinatorics, 2012
- Enumerating -free posets by the number of minimal elements and other statisticsDiscrete Applied Mathematics, 2011
- -free posets, ascent sequences and pattern avoiding permutationsJournal of Combinatorial Theory, Series A, 2010
- Total nonnegativity and (3+1)-free posetsJournal of Combinatorial Theory, Series A, 2003
- A Characterization of (3+1)-Free PosetsJournal of Combinatorial Theory, Series A, 2001
- Incomparability graphs of (3 + 1)-free posets are s-positiveDiscrete Mathematics, 1996
- On immanants of Jacobi-Trudi matrices and permutations with restricted positionJournal of Combinatorial Theory, Series A, 1993
- Counting unlabeled structuresJournal of Combinatorial Theory, Series A, 1987
- Asymptotic enumeration of partial orders on a finite setTransactions of the American Mathematical Society, 1975
- An Asymptotic Expansion for the Coefficients of Some Formal Power SeriesJournal of the London Mathematical Society, 1975