Applications of antilexicographic order. I: An enumerative theory of trees

DOI10.1016/0196-8858(89)90026-2zbMath0723.05046OpenAlexW2108717224MaRDI QIDQ757391

László A. Székely, Péter L. Erdős

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0196-8858(89)90026-2

zbMATH Keywords

partitionsenumeration of treessemilabelled trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (11)

Exponential formulas for models of complex reflection groups ⋮ Schröder parenthesizations and chordates ⋮ Labellable phylogenetic networks ⋮ Counting and enumerating galled networks ⋮ Counting and enumerating tree-child networks and their subclasses ⋮ Phylogenetic network classes through the lens of expanding covers ⋮ Nested sets, set partitions and Kirkman-Cayley dissection numbers ⋮ A new bijection on rooted forests ⋮ The complexity of reconstructing trees from qualitative characters and subtrees ⋮ Matchings and phylogenetic trees ⋮ Counting bichromatic evolutionary trees

Cites Work

• Extremal problems for finite sets and convex hulls---a survey
• On Cayley's Formula for Counting Trees
• On the Distribution of Lengths of Evolutionary Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Applications of antilexicographic order. I: An enumerative theory of trees