A family of subsets of a finite underlying set has the equal union property, if there exist two disjoint subfamilies of the subsets having the same union. The authors prove that any \(n\) nonempty subsets of an \(n\)-element underlying set have this property if the sum of their cardinalities exceeds \(n(n+1)/2.\)
Recommendations
- scientific article; zbMATH DE number 15497
- scientific article; zbMATH DE number 1746425
- An intersection/union theorem for several families of finite sets
- scientific article; zbMATH DE number 3871365
- Complexity of Recognizing Equal Unions in Families of Sets
- Union-closed families of sets
- Union-closed families of sets
- scientific article; zbMATH DE number 528796
- Union-free families of sets and equations over fields
- On a property of families of sets
Cited in
(11)- Equality in a result of Kleitman
- Absolute equal distribution of families of finite sets.
- Polynomial recognition of equal unions in hypergraphs with few vertices of large degree
- A note on transitive union-closed families
- scientific article; zbMATH DE number 15497 (Why is no real title available?)
- Equicovering subgraphs of graphs and hypergraphs
- scientific article; zbMATH DE number 398949 (Why is no real title available?)
- Complexity of Recognizing Equal Unions in Families of Sets
- scientific article; zbMATH DE number 1439465 (Why is no real title available?)
- On structure of the family of regularly distributed sets with respect to the union
- Multiply union families in \(\mathbb{N}^n\)
This page was built for publication: A note on equal unions in families of sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951949)
