Pattern avoidance in labelled trees
From MaRDI portal
Publication:658978
zbMath1295.05204arXiv1110.0844MaRDI QIDQ658978
Publication date: 9 February 2012
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.0844
Trees (05C05) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Asymptotic enumeration (05A16)
Related Items
On the free Lie algebra with multiple brackets, Supertrees, Rooted forests that avoid sets of permutations, Noncontiguous pattern containment in binary trees, Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset
Uses Software