Minimal completely separating systems of sets

Australasian Journal of Combinatorics

Volumn 13, Issue , 1996, Pages 129-150

  Ramsay, Colin ^a   Roberts, Ian T ^b  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b CHARLES DARWIN UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041811196     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. M-C, Cai, Solutions to Edmonds' and Katona's problems on families of separating subsets, Discrete Math., 47 (1983), 13-21.
2. M-C. Cai, On a problem of Katona on minimal completely separating systems with restrictions, Discrete Math., 48 (1984), 121-423.
3. M-C. Cai, On separating systems of graphs, Discrete Math., 49 (1984), 15-20.
4. T. J. Dickson, On a problem concerning separating systems of a finite set, J. Gombin. Theory, 7 (1969), 191-196.
5. G. Katona, On separating systems of a finite set, J. Gombin. Theory, 1 (1966) 174-194.
6. P. Lieby, Personal communication, 1994.
7. C. Ramsay, I. T. Roberts and F. Ruskey, Separation of elements in finite sets, Proceedings of AWOGA 6, NTU Press, Darwin, 1994, 37-47.
8. C. Ramsay, I. T. Roberts and F. Ruskey, Completely separating systems of Assets, To appear.
9. A. Renyi, On random generating elements of a finite Boolean algebra, Acta. Sci. Math. (Szeged), 22 (1961), 75-81.
10. J. Spencer, Minimal completely separating systems, J. Gombin. Theory 8 (1970), 446-447.
11. I. Wegener, On separating systems whose elements are sets of at most k elements, Discrete Math., 28 (1979), 219-222.
12. A. C-C. Yao, On a problem of Katona on minimal separating systems, Discrete Math., 15 (1976), 193-199.