Covering a set by subsets

DOI10.1016/0012-365X(90)90146-9MaRDI QIDQ912112zbMATH OpenOpenAlexFDO

Authors Robert Clarke

Publication date 1990

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(90)90146-9

zbMATH Keywords

partitionsymmetric groupdisordered coverunlabelled sets

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3902673
• scientific article; zbMATH DE number 1153459
• Covers of a Finite Set
• Balanced minimum covers of a finite set
• Covering sets by subsets

Cites work

• Minimal covers of finite sets
• Minimal multiplicative covers of an integer

Cited in

(15)

• Applied Cryptography and Network Security
• A bound on the overlap of same-sized subsets
• Estimating the size of a union of random subsets of fixed cardinality
• Combinatorial problems connected with P. Hall's collection process
• Covering the Recursive Sets
• Recognition of split-graphic sequences
• The number of certain \(k\)-combinations of an \(n\)-set
• Binary linear complementary dual codes
• Covers of a Finite Set
• Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
• On the number of antichains and antichain covers of labeled sets
• Covering sets by subsets
• On coverings of a finite set: Depth and subcovers
• Finding balance: split graphs and related classes
• Split graphs and Nordhaus-Gaddum graphs

This page was built for publication: Covering a set by subsets

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