A refinement of leaves on noncrossing trees

DOI10.1007/S00373-011-1097-ZMaRDI QIDQ1938892zbMATH OpenOpenAlexWikidataFDO

Authors Sabrina X. M. Pang, Lun Lv

Publication date 25 February 2013

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-011-1097-z

zbMATH Keywords

left leafNC-forestNC-treeright leaf

Mathematics Subject Classification ID

Trees (05C05) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30)

Recommendations

• Noncrossing trees and noncrossing graphs
• Statistics on non-crossing trees
• Old and young leaves on plane trees
• Noncrossing trees are almost conditioned Galton–Watson trees
• Locally oriented noncrossing trees

Cites work

• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• A bijection on ordered trees and its consequences
• Analytic combinatorics of non-crossing configurations
• Bijections for ternary trees and non-crossing trees
• Consecutive pattern avoidances in non-crossing trees
• Descents in noncrossing trees
• Enumeration of noncrossing trees on a circle
• Enumerations of ordered trees
• Noncrossing trees and noncrossing graphs
• Patterns in trees
• Statistics on non-crossing trees
• String pattern avoidance in generalized non-crossing trees
• The On-Line Encyclopedia of Integer Sequences

Cited in

(5)

• Enumeration of \(k\)-noncrossing trees and forests
• On extremal leaf status and internal status
• Locally oriented noncrossing trees
• Leaf Pairs and Tree Dissections
• Old and young leaves on plane trees

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: A refinement of leaves on noncrossing trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1938892)