| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903598 | European Journal of Combinatorics | 2018 | 7 Pages |
Abstract
In an approach to the Cayley formula for counting trees, Shor discovered a refined recurrence relation concerning the number of improper edges. Chen and the author gave a bijection for the Shor recurrence based on the combinatorial interpretations of Zeng, answering a question of Shor. In this paper, we present a new bijective proof of the Shor recurrence by applying Shor's formula for counting forests of rooted trees with roots 1,â¦,r and with a given number of improper edges.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Victor J.W. Guo,