Generating all subsets of a finite set with disjoint unions
From MaRDI portal
Publication:640845
Abstract: If X is an n-element set, we call a family G of subsets of X a k-generator for X if every subset of X can be expressed as a union of at most k disjoint sets in G. Frein, Leveque and Sebo conjectured that for n > 2k, the smallest k-generators for X are obtained by taking a partition of X into classes of sizes as equal as possible, and taking the union of the power-sets of the classes. We prove this conjecture for all sufficiently large n when k = 2, and for n a sufficiently large multiple of k when k > 2.
Recommendations
- Note on generating all subsets of a finite set with disjoint unions
- Generating All Sets With Bounded Unions
- scientific article; zbMATH DE number 822743
- scientific article; zbMATH DE number 559036
- Recursive generation of all \(k\)-element partitions of a finite set
- Publication:4863420
- Generating combinatorial sets with given properties
- Constructing union-free pairs of \(k\)-element subsets
- scientific article; zbMATH DE number 553907
- Generating countable groups by discrete subsets
Cites work
- scientific article; zbMATH DE number 3188526 (Why is no real title available?)
- 2-Bases of Quadruples
- Extremal Graphs without Large Forbidden Subgraphs
- Generating All Sets With Bounded Unions
- Note on generating all subsets of a finite set with disjoint unions
- Some intersection theorems for ordered sets and graphs
- Supersaturated graphs and hypergraphs
- Testing \(k\)-colorability
- The maximum number of disjoint pairs in a family of subsets
Cited in
(4)
This page was built for publication: Generating all subsets of a finite set with disjoint unions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640845)
