On the number of vertices of each rank in phylogenetic trees and their generalizations

zbMath1400.05118arXiv1505.07437MaRDI QIDQ2965979

Miklós Bóna

Publication date: 3 March 2017

Full work available at URL: https://arxiv.org/abs/1505.07437

zbMATH Keywords

distributionranksenumerationasymptoticrootsearch treenumerical dataleaves

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)

Related Items (3)

Counting General Phylogenetic networks ⋮ Protected Vertices in Motzkin trees ⋮ Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks

This page was built for publication: On the number of vertices of each rank in phylogenetic trees and their generalizations