A new proof of Cayley's formula for counting labeled trees
From MaRDI portal
Publication:1894017
DOI10.1016/0097-3165(95)90022-5zbMATH Open0826.05036OpenAlexW1987139164MaRDI QIDQ1894017FDOQ1894017
Publication date: 21 August 1995
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(95)90022-5
Trees (05C05) Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30)
Cites Work
Cited In (19)
- Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices
- Arboretum for a generalisation of Ramanujan polynomials
- \(q\)-log-convexity from linear transformations and polynomials with only real zeros
- A bijective proof of the Shor recurrence
- A new proof of Cayley's formula for labeled spanning trees
- A context-free grammar for the Ramanujan-Shor polynomials
- A remark on the enumeration of rooted labeled trees
- A REFINEMENT FOR ORDERED LABELED TREES
- A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)
- Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs
- A generalization of the Ramanujan polynomials and plane trees
- Derivatives of the tree function
- A counting formula for labeled, rooted forests
- Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions
- Runs in labelled trees and mappings
- Coalescent random forests
- Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees
- C-semiring Frameworks for Minimum Spanning Tree Problems
- Bijections behind the Ramanujan polynomials
This page was built for publication: A new proof of Cayley's formula for counting labeled trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894017)
