Enumerative combinatorics of unlabeled and labeled time-consistent galled trees
Combinatorics
2025-04-24 v1 Populations and Evolution
Abstract
In mathematical phylogenetics, the time-consistent galled trees provide a simple class of rooted binary network structures that can be used to represent a variety of different biological phenomena. We study the enumerative combinatorics of unlabeled and labeled time-consistent galled trees. We present a new derivation via the symbolic method of the number of unlabeled time-consistent galled trees with a fixed number of leaves and a fixed number of galls. We also derive new generating functions and asymptotics for labeled time-consistent galled trees.
Keywords
Cite
@article{arxiv.2504.16302,
title = {Enumerative combinatorics of unlabeled and labeled time-consistent galled trees},
author = {Lily Agranat-Tamir and Michael Fuchs and Bernhard Gittenberger and Noah A. Rosenberg},
journal= {arXiv preprint arXiv:2504.16302},
year = {2025}
}