Optimizing diversity

DOI10.1016/J.ENDM.2007.07.013MaRDI QIDQ3503453zbMATH OpenOpenAlexFDO

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

Publication date 5 June 2008

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2007.07.013

zbMATH Keywords

diversityextremal problems in graphs and hypergraphssemi-finished productsTurán type problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05)

Recommendations

• Generating All Sets With Bounded Unions
• A minimax problem for set system
• Diversity
• Diversity of uniform intersecting families
• Note on generating all subsets of a finite set with disjoint unions

Cites work

• 2-Bases of Quadruples
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• What we know and what we do not know about Turán numbers

Cited in

(2)

• Generating All Sets With Bounded Unions
• The Optimal Diversity Management Problem

This page was built for publication: Optimizing diversity

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