Evolutionary Families of Sets

Abstract

A finite family of subsets of a finite set is said to be evolutionary if its members can be ordered so that each subset except the first has an element in the union of the previous subsets and also an element not in that union. The study of evolutionary families is motivated by a conjecture of Naddef and Pulleyblank concerning ear decompositions of 1-extendable graphs. The present paper gives some sufficient conditions for a family to be evolutionary.

Combinatorial views on persistent characters in phylogenetics

“…so that (i) each set contains at least one element of X which occurs in an earlier set in the sequence, and (ii) each set contains at least one element that is absent from any earlier set in the sequence. This notion was studied in [4]. Is the problem of determining whether C has an evolutionary ordering NP-complete?…”

Computing an Evolutionary Ordering is Hard

“…We study the problem of computing evolutionary orderings of families of sets, as introduced by Little and Campbell [1]. Definition 1.…”