Recommendations
Cited in
(25)- A refinement of leaves on noncrossing trees
- Dyck paths with coloured ascents
- Enumeration of \(k\)-noncrossing trees and forests
- Nested Catalan tables and a recurrence relation in noncommutative quantum field theory
- Decomposition and merging algorithms for noncrossing forests
- Noncrossing trees are almost conditioned Galton–Watson trees
- Locally oriented noncrossing trees
- Descents in noncrossing trees
- 2-noncrossing trees and 5-ary trees
- Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
- Noncrossing trees and noncrossing graphs
- Non-ambiguous trees: new results and generalisation
- A decomposition algorithm for noncrossing trees
- scientific article; zbMATH DE number 2077645 (Why is no real title available?)
- scientific article; zbMATH DE number 1504631 (Why is no real title available?)
- Edge crossings in random linear arrangements
- Extremal statistics on non-crossing configurations
- Extremal statistics on non-crossing configurations
- Non-ambiguous trees: new results and generalization
- Consecutive pattern avoidances in non-crossing trees
- 2-binary trees: bijections and related issues
- scientific article; zbMATH DE number 2046075 (Why is no real title available?)
- Planted Brussels Sprouts (after Ji-Propp)
- Non-crossing tree realizations of ordered degree sequences
- Simply generated non-crossing partitions
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)