Covering sets by subsets
From MaRDI portal
Let to every element x of a finite set M be associated some nonempty subset M(x) of M in such a way that the implication \(y\in M(x)\Rightarrow x\in M(y)\) is fulfilled. We prove two upper estimations for the least number of sets M(x) which are necessary to cover M. Several applications to number theory are presented.
Recommendations
Cites work
Cited in
(18)- Covering \(t\)-element sets by partitions
- On the covering of \(t\)-sets with \((t+1)\)-sets: \(C(9,5,4)\) and \(C(10,6,5)\)
- Covering radius for sets of permutations
- Set cover problems with small neighborhood covers
- Pairs Covered by a Sequence of Sets
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
- Covering the Recursive Sets
- scientific article; zbMATH DE number 3902673 (Why is no real title available?)
- scientific article; zbMATH DE number 3478888 (Why is no real title available?)
- scientific article; zbMATH DE number 1107517 (Why is no real title available?)
- scientific article; zbMATH DE number 1153459 (Why is no real title available?)
- scientific article; zbMATH DE number 808806 (Why is no real title available?)
- Set covering number for a finite set
- scientific article; zbMATH DE number 7177936 (Why is no real title available?)
- scientific article; zbMATH DE number 6327514 (Why is no real title available?)
- Applied Cryptography and Network Security
- On coverings of a finite set: Depth and subcovers
- Covering a set by subsets
This page was built for publication: Covering sets by subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797580)
