Pages that link to "Item:Q1715620"
From MaRDI portal
The following pages link to Rooted forests that avoid sets of permutations (Q1715620):
Displaying 14 items.
- Runs in labelled trees and mappings (Q776318) (← links)
- A family of invariants of rooted forests. (Q1426341) (← links)
- Integer sequences and monomial ideals (Q2052868) (← links)
- Classical and consecutive pattern avoidance in rooted forests (Q2102695) (← links)
- Maximal chains in bond lattices (Q2161194) (← links)
- Embedding small digraphs and permutations in binary trees and split trees (Q2292861) (← links)
- Forest-like permutations (Q2427010) (← links)
- Pattern avoidance in forests of binary shrubs (Q2831896) (← links)
- Pattern restricted quasi-Stirling permutations (Q5197606) (← links)
- Forests and pattern-avoiding permutations modulo pure descents (Q5218109) (← links)
- Wilf equivalences for patterns in rooted labeled forests (Q6118359) (← links)
- Stanley-Wilf limits for patterns in rooted labeled forests (Q6146494) (← links)
- Combinatorial generation via permutation languages. VI: Binary trees (Q6612300) (← links)
- Dyck paths, binary words, and Grassmannian permutations avoiding an increasing pattern (Q6621953) (← links)
