Abstract
R(n) denotes the minimum possible size of a completely separating system C on an n-set. R(n, h, k) denotes the minimum possible size of a completely separating system C on an n-set with h ≤ |A| ≤ k for each A Ä C. In this paper a catalogue of non-isomorphic systems which achieve R(n) for n ≤ 10 is given. Values of R(n, h, k) are determined for n ≤ 10 and for n > k²/â‚‚.
Original language | English |
---|---|
Number of pages | 10 |
Journal | Australasian Journal of Combinatorics |
Publication status | Published - 2005 |
Keywords
- Sperner theory
- block designs
- combinatorial analysis
- combinatorial set theory
- completely separating systems (CSS)
- partially ordered sets