Minimum matrix representation of Sperner systems

Discrete Applied Mathematics

Volumn 81, Issue 1-3, 1998, Pages 9-17

  Bennett, F E ^a   Wu, L ^b  

^a MOUNT SAINT VINCENT UNIVERSITY   (Canada)

^b SOOCHOW UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042123197     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00051-0     Document Type: Article

References (10)

1. W.W. Armstrong, Dependency structures of data base relationship, in: Informatin Processing 74, North-Holland, Amsterdam, 1974, pp. 580-583.
2. F.E. Bennett, Lisheng Wu, On minimum matrix representation of closure operations, Discrete Appl. Math. 26 (1990) 25-40.
3. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Elsevier, Amsterdam, 1982.
4. J. Demetrovics, On the equivalence of candidate keys with Sperner systems, Acta Cybernet 4 (1979) 247-252.
5. J. Demetrovics, Candidate keys and antichains, SIAM J. Algebraic Discrete Methods 1 (1980) 92.
6. J. Demetrovics, Z. Füredi, G.O.H. Katona, Minimum matrix representation of closure operations, Discrete Appl. Math. 11 (1985) 115-128.
7. J. Demetrovics, G.O.H. Katona, Extremal combinational problems of database models, in: Lecture Notes in Computer Science, vol. 305 1987, Springer, Berlin, New York, pp. 99-127.
8. J. Demetrovics, V.D. Thi, Keys, antikeys and prime attributes, Ann. Univ. Sci. Budapest. Sect. Comput 8 (1987) 35-52.
9. Z. Füredi, Perfect error-correcting databases, Discrete Appl. Math. 28 (1990) 171-176.
10. B. Ganter, H.-D.O.F. Gronau, Two conjectures of Demetrovics, Füredi and Katona, concerning partitions, Discrete Math. 88 (1991) 149-155.