A bijection between vertices of rank 1 in increasing trees and derangements

2022/10/10 by Mario Midence-Ordóñez, Midence-Ordóñez, Mario
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.2210.05016

openalex publication_date 2022/10/10 · openalex created_date 2022/10/14 · openalex updated_date 2026/07/28

Abstract

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.

Related

• A refined bijection between alternating permutations and 0-1-2 increasing trees
• Derangements with Ascending and Descending Blocks
• Height restricted lattice paths, Elenas, and bijections
• Combinatorial differential operators in: Faà di Bruno formula, enumeration of ballot paths, enriched rooted trees and increasing rooted trees
• Bijections in weakly increasing trees via binary trees