On coverings of a finite set: Depth and subcovers

DOI10.1007/BF02109371zbMATH Open0545.05005MaRDI QIDQ797579FDOQ797579

Authors: Chang Mo Bang, Peter Winkler, Henry jun. Sharp 

Publication date: 1984

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3902673
• scientific article
• scientific article; zbMATH DE number 3365349
• Covering sets by subsets
• Covers of a Finite Set
• Covering a set by subsets
• scientific article; zbMATH DE number 3446866
• Covering the recursive sets
• Covering the Recursive Sets
• Covering dimension and finite spaces

zbMATH Keywords

coveringsprojective designsdepth of covers

Mathematics Subject Classification ID

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

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Uniformly deep families of k-membered subsets of n
• Title not available (Why is that?)

Cited In (3)

• Multiply-intersecting families
• Matchings and covers in hypergraphs
• t-expansive and t-wise intersecting hypergraphs

This page was built for publication: On coverings of a finite set: Depth and subcovers

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