Descents in noncrossing trees

MaRDI QIDQ1422136zbMATHFDO

Authors David S. Hough

Publication date 5 February 2004

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/123235

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

generating function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Recommendations

• A decomposition algorithm for noncrossing trees
• Noncrossing trees and noncrossing graphs
• Statistics on non-crossing trees
• scientific article; zbMATH DE number 2077645
• Counting forests by descents and leaves

Cited in

(10)

• A refinement of leaves on noncrossing trees
• Dyck paths with coloured ascents
• Enumeration of \(k\)-noncrossing trees and forests
• Decomposition and merging algorithms for noncrossing forests
• Locally oriented noncrossing trees
• Noncrossing trees and noncrossing graphs
• A decomposition algorithm for noncrossing trees
• scientific article; zbMATH DE number 2077645 (Why is no real title available?)
• Consecutive pattern avoidances in non-crossing trees
• 2-binary trees: bijections and related issues

This page was built for publication: Descents in noncrossing trees

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