On the existence of infinitely many universal tree-based networks
1Department of Statistical Science, School of Multidisciplinary Sciences, SOKENDAI (The Graduate University for Advanced Studies), Tokyo 190-8562, Japan; The Institute of Statistical Mathematics, Tokyo 190-8562, Japan.
Abstract:
A tree-based network on a set X of n leaves is said to be universal if any rooted binary phylogenetic tree on X can be its base tree. Francis and Steel showed that there is a universal tree-based network on X in the case of n = 3, and asked whether such a network exists in general. We settle this problem by proving that there are infinitely many universal tree-based networks for any n>1.
Related Concept Videos
Circuit Terminology
A circuit, on the other hand, is also an interconnected system of electrical elements but must contain one or more closed paths.
Sequence Networks of Rotating Machines
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Second Uniqueness Theorem
In contrast, consider that the electric field is non-unique and apply Gauss's law in divergence form in the region between the conductors and the integral form to the surface...
Phylogenetic Trees
Phylogenetic Trees
Network Function of a Circuit


