Completely separating systems of k-sets for (k−1/2)

Ian Roberts, Suzanne D'Arcy, Hans-Dietrich O.F Gronau

    Research output: Contribution to journalArticlepeer-review

    7 Downloads (Pure)


    Here R(n, k) denotes the minimum possible size of a completely separating system C on [n] with {pipe}A{pipe} = k for each A ? C. Values of R(n, k) are determined for (k-1 2) ? n < (k 2) or 11 ? n ? 12. Using the dual interpretation of completely separating systems as antichains, this paper provides corresponding results for dual k-regular antichains.
    Original languageEnglish
    Pages (from-to)73-94
    Number of pages22
    JournalAustralasian Journal of Combinatorics
    Publication statusPublished - 2013


    Dive into the research topics of 'Completely separating systems of k-sets for (k−1/2)'. Together they form a unique fingerprint.

    Cite this