A bijection between vertices of rank 1 in increasing trees and derangements
We give a combinatorial proof of a recent result of Bóna by constructing a bijection from the set of all neighbors of leaves of increasing trees of size $n$ to the set of derangements of length $n$.
math.CO↗