Statistics on non-crossing trees

DOI10.1016/S0012-365X(01)00366-1zbMath0999.05018OpenAlexW2091197720MaRDI QIDQ1613530

Emeric Deutsch, Marc Noy

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

zbMATH Keywords

generating functionsasymptotic enumerationstatisticsnon-crossing tree

Mathematics Subject Classification ID

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

Related Items

Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees ⋮ Nested Catalan tables and a recurrence relation in noncommutative quantum field theory ⋮ Consecutive pattern avoidances in non-crossing trees ⋮ Locally oriented noncrossing trees ⋮ A decomposition algorithm for noncrossing trees ⋮ A refinement of leaves on noncrossing trees ⋮ Simply Generated Non-Crossing Partitions ⋮ Unnamed Item ⋮ Dyck paths with coloured ascents ⋮ Edge crossings in random linear arrangements ⋮ Extremal statistics on non-crossing configurations ⋮ 2-binary trees: bijections and related issues ⋮ Unnamed Item ⋮ Decomposition and merging algorithms for noncrossing forests ⋮ 2-noncrossing trees and 5-ary trees