A finite set covering theorem II

DOI10.1017/S000497270004421XzbMath0223.05002MaRDI QIDQ5628131

Alan Brace, David E. Daykin

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)

Related Items

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