On trees and noncrossing partitions

DOI10.1016/S0166-218X(97)00118-2zbMath0904.05003MaRDI QIDQ1383385

Martin Klazar

Publication date: 11 January 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

trees; noncrossing partitions; identities for partitions; normal noncrossing sequences

Mathematics Subject Classification ID

05C05: Trees

05A15: Exact enumeration problems, generating functions

05A18: Partitions of sets

Related Items

Enumeration of \((k,2)\)-noncrossing partitions, Partitions of a set satisfying certain set of conditions, Reduction of \(m\)-regular noncrossing partitions, Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chain enumeration and non-crossing partitions
• On the structure of the lattice of noncrossing partitions
• On some new sequences generalizing the Catalan and Motzkin numbers
• Combinatorial statistics on non-crossing partitions
• Linear trees and RNA secondary structure
• Combinatorial aspects of Davenport-Schinzel sequences
• On \(abab\)-free and \(abba\)-free set partitions
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Étude et denombrement parallèles des partitions non-croisees d'un cycle et des decoupages d'un polygone convexe
• A general bijective algorithm for trees.
• Enumerating Davenport-Schinzel sequences
• Catalan numbers revisited