Bijections for Ranked Tree-Child Networks
Combinatorics
2022-01-17 v2
Abstract
The class of ranked tree-child networks, tree-child networks arising from an evolution process with a fixed embedding into the plane, has recently been introduced by Bienvenu, Lambert, and Steel. These authors derived counting results for this class. In this note, we will give bijective proofs of three of their results. Two of our bijections answer questions raised in their paper.
Cite
@article{arxiv.2105.10137,
title = {Bijections for Ranked Tree-Child Networks},
author = {Alessandra Caraceni and Michael Fuchs and Guan-Ru Yu},
journal= {arXiv preprint arXiv:2105.10137},
year = {2022}
}
Comments
revised version, 12 pages, 13 Figures