Completely separating systems of k-sets for k-12 n

MaRDI QIDQ2869294zbMATH OpenFDO

Authors Ian T. Roberts, Sue D'Arcy, Hans-Dietrich O. F. Gronau

Publication date 3 January 2014

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://ajc.maths.uq.edu.au/pdf/55/ajc_v55_p073.pdf

zbMATH Keywords

dual \(k\)-regular antichains

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05)

Recommendations

• scientific article; zbMATH DE number 2230922
• Minimal completely separating systems of \(k\)-sets
• Completely separating systems of k-sets
• Publication:4863494
• Inclusionwise minimal completely separating systems

Cited in

(6)

• Minimal completely separating systems of \(k\)-sets
• scientific article; zbMATH DE number 2230922 (Why is no real title available?)
• scientific article; zbMATH DE number 841642 (Why is no real title available?)
• Antichains and completely separating systems -- a catalogue and applications
• Generalized set dominating and separating systems
• On the number of minimal completely separating systems and antichains in a Boolean lattice

This page was built for publication: Completely separating systems of \(k\)-sets for \(\binom{k-1}{2}\leq n<\binom{k}{2}\) or \(11\leq k\leq 12\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869294)