A bijective enumeration of labeled trees with given indegree sequence

DOI10.1016/j.jcta.2010.07.001zbMath1225.05083arXiv0805.0067OpenAlexW2950703920WikidataQ114162745 ScholiaQ114162745MaRDI QIDQ616443

Heesung Shin, Zeng, Jiang

Publication date: 7 January 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

labeled treesbijections\(q\)-binomial coefficients\(q\)-Chu-Vandermondeindegree sequencePrüfer-like code

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (5)

Locally oriented noncrossing trees ⋮ Effective divisors on \({\overline{\mathcal{M}}}_g\) associated to curves with exceptional secant planes ⋮ A recursive algorithm for trees and forests ⋮ A bijective proof of the Shor recurrence ⋮ A combinatorial approach for discrete car parking on random labelled trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trees and function classes
• Hall--Littlewood functions and the A\(_2\) Rogers--Ramanujan identities
• Counting labelled trees with given indegree sequence
• A trinomial analogue of Bailey's lemma and \(N=2\) superconformal invariance
• Factorizations of some weighted spanning tree enumerators
• Geometry of curves with exceptional secant planes: Linear series along the general curve

This page was built for publication: A bijective enumeration of labeled trees with given indegree sequence