On Separating Families of Bipartitions

Details On Separating Families of Bipartitions On Separating Families of Bipartitions

2011-11-06

arxiv.org/abs/1111.1376v1

Mathematics

Combinatorics

Scientific paper

In this paper, we focus on families of bipartitions, i.e. set partitions consisting of at most two components. We say that a family of bipartitions is a separating family for a set $S$ if every two elements in $S$ can be separated by some bipartition. Furthermore, we call a separating family minimal if no proper subfamily is a separating family. We characterize the set of all minimal separating families of maximum size for arbitrary set $S$ as the set of all spanning trees on $S$ and enumerate minimal separating families of maximum size. Furthermore, we enumerate separating families of arbitrary size, which need not be minimal.

Affiliated with

Also associated with

No associations

Rating

On Separating Families of Bipartitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Separating Families of Bipartitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Separating Families of Bipartitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-704413