Ordered partitions and drawings of rooted plane trees

DOI10.1016/j.disc.2014.08.014zbMath1301.05270arXiv1301.6327OpenAlexW2963864548MaRDI QIDQ468423

Qingchun Ren

Publication date: 7 November 2014

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

Full work available at URL: https://arxiv.org/abs/1301.6327

zbMATH Keywords

hyperplane arrangementKlazar treesordered partitionsrooted plane trees

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

From Madhava–Leibniz to Lehmer’s Limit ⋮ Torus link homology and the nabla operator ⋮ The cycle descent statistic on permutations

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Twelve countings with rooted plane trees
• Klazar trees and perfect matchings
• Preferential Arrangements

This page was built for publication: Ordered partitions and drawings of rooted plane trees