On the asymptotic growth of the number of tree-child networks

Abstract

In a recent paper, McDiarmid, Semple, and Welsh (2015) showed that the number of tree-child networks with n leaves has the factor n^2n in its main asymptotic growth term. In this paper, we improve this by completely identifying the main asymptotic growth term up to a constant. More precisely, we show that the number of tree-child networks with n leaves grows like where a1=-2.338107410... is the largest root of the Airy function of the first kind. For the proof, we bijectively map the underlying graph-theoretical problem onto a problem on words. For the latter, we can find a recurrence to which a recent powerful asymptotic method of Elvey Price, Fang, and Wallner (2019) can be applied.