Evolutionary families of sets
The electronic journal of combinatorics, Tome 7 (2000)
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.
DOI :
10.37236/1488
Classification :
05D05, 05C35, 05C38
Mots-clés : ear decompositions of graphs, evolutionary families of sets, dendritic families of sets, evolutionary orderings
Mots-clés : ear decompositions of graphs, evolutionary families of sets, dendritic families of sets, evolutionary orderings
@article{10_37236_1488,
author = {C. H. C. Little and A. E. Campbell},
title = {Evolutionary families of sets},
journal = {The electronic journal of combinatorics},
year = {2000},
volume = {7},
doi = {10.37236/1488},
zbl = {0940.05066},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1488/}
}
C. H. C. Little; A. E. Campbell. Evolutionary families of sets. The electronic journal of combinatorics, Tome 7 (2000). doi: 10.37236/1488
Cité par Sources :