Non-contiguous pattern avoidance in binary trees
From MaRDI portal
Publication:456347
zbMath1252.05086arXiv1203.0795MaRDI QIDQ456347
Samantha Tyner, Casey Wynn, Michael Dairyko, Lara K. Pudwell
Publication date: 24 October 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.0795
Related Items (8)
Supertrees ⋮ The Dyck pattern poset ⋮ A general theory of Wilf-equivalence for Catalan structures ⋮ Permutation classes and polyomino classes with excluded submatrices ⋮ On the sub-permutations of pattern avoiding permutations ⋮ Noncontiguous pattern containment in binary trees ⋮ Counting embeddings of rooted trees into families of rooted trees ⋮ Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset
Uses Software
This page was built for publication: Non-contiguous pattern avoidance in binary trees
