Generating all subsets of a finite set with disjoint unions

DOI10.1016/j.jcta.2011.06.003zbMath1232.05223arXiv1010.4877OpenAlexW2149006854MaRDI QIDQ640845

David Ellis, Benjamin Sudakov

Publication date: 21 October 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.4877

zbMATH Keywords

generatorextremal set theorydisjoint unions

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (2)

Comparable pairs in families of sets ⋮ Quadratic reformulations of nonlinear binary optimization problems

Cites Work

• Unnamed Item
• Supersaturated graphs and hypergraphs
• Note on generating all subsets of a finite set with disjoint unions
• The maximum number of disjoint pairs in a family of subsets
• Some intersection theorems for ordered sets and graphs
• Testing k-colorability
• 2-Bases of Quadruples
• Generating All Sets With Bounded Unions
• Extremal Graphs without Large Forbidden Subgraphs

This page was built for publication: Generating all subsets of a finite set with disjoint unions