Statistics on non-crossing trees

DOI10.1016/S0012-365X(01)00366-1zbMATH Open0999.05018OpenAlexW2091197720MaRDI QIDQ1613530FDOQ1613530

Marc Noy, Emeric Deutsch

Publication date: 29 August 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00366-1

Recommendations

• Publication:4502588
• scientific article; zbMATH DE number 2197876
• Noncrossing trees are almost conditioned Galton–Watson trees
• Locally oriented noncrossing trees
• Enumeration of noncrossing trees on a circle

zbMATH Keywords

statisticsgenerating functionsasymptotic enumerationnon-crossing tree

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Asymptotic enumeration (05A16)

Cited In (20)

• Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
• Title not available (Why is that?)
• Consecutive pattern avoidances in non-crossing trees
• Noncrossing trees are almost conditioned Galton–Watson trees
• Dyck paths with coloured ascents
• Nested Catalan tables and a recurrence relation in noncommutative quantum field theory
• Simply Generated Non-Crossing Partitions
• Extremal statistics on non-crossing configurations
• Descents in noncrossing trees
• Edge crossings in random linear arrangements
• Title not available (Why is that?)
• Locally oriented noncrossing trees
• A decomposition algorithm for noncrossing trees
• Decomposition and merging algorithms for noncrossing forests
• 2-binary trees: bijections and related issues
• A refinement of leaves on noncrossing trees
• 2-noncrossing trees and 5-ary trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Statistics on non-crossing trees

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