5 problems

Let $N$ be a network. Tree-child proximity conjecture. … The conjecture asks whether the analogous inequality to the known result $A_{\mathcal{TC}}(N)\le L_{\mathcal{TC}}(N)$ holds…

Let $\mathcal{TC}_{n,k}$ be the set of all tree-child networks with $n$ leaves and $k$ reticulation nodes. The numbers $a_{n-1,k}$ are the coefficients appearing in the paper's pre…

Let $TC_{n,k}$ denote the class of binary tree-child networks with $k$ reticulations and $n$ leaves, and let $|TC_{n,k}|$ be its cardinality. Tree-child network recursion conjectur…

Let $N$ and $N'$ be non-binary tree-child networks on the same leaf set. A tree-child sequence (TCS) of $N$ is a sequence of reductions associated with the tree-child network. Univ…

Huber–Moulton's trinet-encoding conjecture. Every recoverable rooted phylogenetic network is encoded by its set of trinets.