2004/09/18 by Seunghyun Seo, Seo, Seunghyun
Computer Science · Mathematics · #05A15 (Primary) #05C05 #05C30 (Secondary) #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Topological and Geometric Data Analysis #math.CO #msc:05A15 #msc:05C05 #msc:05C30
paper · pdf · doi:10.48550/arxiv.math/0409323
9 pages, 3 figures (use PSTricks)
arxiv created 2004/09/18 · openalex publication_date 2004/09/18 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled trees, and labeled plane trees.