Abstract
A split system on a multiset is a set of bipartitions of . Such a split system is compatible if it can be represented by a tree in such a way that the vertices of the tree are labelled by the elements in , the removal of each edge in the tree yields a bipartition in by taking the labels of the two resulting components, and every bipartition in can be obtained from the tree in this way. In this contribution, we present a novel characterization for compatible split systems, and for split systems admitting a unique tree representation. In addition, we show that a conjecture on compatibility stated in 2008 holds for some large classes of split systems.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.