A finite set covering theorem II

DOI10.1017/S000497270004421XzbMATH Open0223.05002MaRDI QIDQ5628131FDOQ5628131

David E. Daykin, Alan Brace

Publication date: 1972

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of packing and covering (05B40)

Cited In (5)

• The covering radius of extreme binary 2-surjective codes
• Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions
• On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)
• The maximum number of balancing sets
• Sperner families satisfying additional conditions and their convex hulls

This page was built for publication: A finite set covering theorem II

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