Statistics on non-crossing trees
From MaRDI portal
Publication:1613530
DOI10.1016/S0012-365X(01)00366-1zbMATH Open0999.05018OpenAlexW2091197720MaRDI QIDQ1613530FDOQ1613530
Authors: 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
Recommendations
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Asymptotic enumeration (05A16)
Cited In (25)
- 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
- Planted Brussels Sprouts (after Ji-Propp)
- Dyck paths with coloured ascents
- Nested Catalan tables and a recurrence relation in noncommutative quantum field theory
- Non-crossing tree realizations of ordered degree sequences
- Extremal statistics on non-crossing configurations
- Descents in noncrossing trees
- Edge crossings in random linear arrangements
- Non-ambiguous trees: new results and generalization
- Enumeration of \(k\)-noncrossing trees and forests
- Non-ambiguous trees: new results and generalisation
- Title not available (Why is that?)
- Locally oriented noncrossing trees
- Simply generated non-crossing partitions
- Noncrossing trees and noncrossing graphs
- 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?)
- Extremal statistics on non-crossing configurations
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)
