ISIPhyNC - Property: Upper bound on the number of vertices


The number of vertices is bounded by the number of leaves.

More formally

There exists a function f such that any network with n leaves has at most f(n) vertices.

Phylogenetic network classes with this property

All classes

In the inclusion diagram below, the names of classes with this property are colored.

About this website

This website was programmed and is maintained by Philippe Gambette. It was started during the internship of Maxime Morgado at LIGM, in June-July 2015, and also contains contributions made from Narges Tavassoli from November 2016 to January 2017.

Please contact Philippe Gambette if you have any suggestions about this website, especially about problems, properties, results or subclasses to add.

How to cite

P. Gambette, M. Morgado, N. Tavassoli & M. Weller (2018) ISIPhyNC, an Information System on Inclusions of Phylogenetic Network Classes, manuscript in preparation.

Database content

73 classes of phylogenetic networks including 35 classes of binary phylogenetic networks (defined in a total of 20 bibliographic references), 51 inclusion relationships proved directly between classes (including some found in a total of 9 bibliographic references), 24 networks (68 memberships to a class, 56 non-memberships to a class), 3 problems considered, 3 properties considered, 37 theorems proved directly (including some found in a total of 17 bibliographic references) including 26 positive results (which can be extended to subclasses) and 11 negative results (which can be extended to superclasses).