Generating All Sets With Bounded Unions

DOI10.1017/S096354830800922XMaRDI QIDQ3529508zbMATH OpenOpenAlexFDO

Authors Yannick Frein, Benjamin Lévêque, András Sebö

Publication date 13 October 2008

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s096354830800922x

Mathematics Subject Classification ID

Partitions of sets (05A18)

Recommendations

• Optimizing diversity
• Note on generating all subsets of a finite set with disjoint unions
• Generating all subsets of a finite set with disjoint unions
• Inequalities for cross-unions of collections of finite sets
• Constructing union-free pairs of \(k\)-element subsets

Cites work

• 2-Bases of Quadruples
• What we know and what we do not know about Turán numbers

Cited in

(5)

• Quadratic reformulations of nonlinear binary optimization problems
• Optimizing diversity
• On the effective generation of set elements within specified ranges
• Note on generating all subsets of a finite set with disjoint unions
• Generating all subsets of a finite set with disjoint unions

This page was built for publication: Generating All Sets With Bounded Unions

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