A refinement of leaves on noncrossing trees

DOI10.1007/S00373-011-1097-ZzbMATH Open1258.05052OpenAlexW2028426890WikidataQ60691937 ScholiaQ60691937MaRDI QIDQ1938892FDOQ1938892

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

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

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)

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Title not available (Why is that?)
• Enumerations of ordered trees
• Analytic combinatorics of non-crossing configurations
• Patterns in trees
• Enumeration of noncrossing trees on a circle
• Descents in noncrossing trees
• Bijections for ternary trees and non-crossing trees
• Statistics on non-crossing trees
• Noncrossing trees and noncrossing graphs
• Consecutive pattern avoidances in non-crossing trees
• String pattern avoidance in generalized non-crossing trees
• A bijection on ordered trees and its consequences

Cited In (5)

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

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)