The number of maximal independent sets in a tree
SIAM Journal on Algebraic and Discrete Methods
The number of maximal independent sets in a connected graph
Discrete Mathematics
A note on independent sets in trees
SIAM Journal on Discrete Mathematics
On minimum matrix representation of closure operations
Discrete Applied Mathematics
Perfect error-correcting databases
Discrete Applied Mathematics
Two conjectures of Demetrovics, Furedi, and Katona, concerning partitions
Discrete Mathematics
The number of maximal independent sets in triangle-free graphs
SIAM Journal on Discrete Mathematics
Maximal independent sets in bipartite graphs
Journal of Graph Theory
Minimum matrix representation of Sperner systems
Discrete Applied Mathematics
Combinatorial and Algebraic Results for Database Relations
ICDT '92 Proceedings of the 4th International Conference on Database Theory
Minimum Matrix Representation of Some Key System
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Extremal Combinatorial Problems in Relational Data Base
FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
Minimum matrix representation of closure operations
Discrete Applied Mathematics
| Hi-index | 0.00 |
We say, that a database relation represents a Sperner system K on the set of attributes, if the system of minimal keys is exactly K. It is known, that such a representation always exsists. In this paper we show, that the maximum of the minimal number of tuples, that are needed to represent a Sperner system of only two element sets is 3(n/3+o(n)). We consider this problem for other classes of Sperner systems (e.g for the class of trees, i.e. each minimal key has cardinality two, and the keys form a tree), too.