A set coverage problem

DOI10.1016/j.ipl.2009.11.012zbMath1197.05156DBLPjournals/ipl/ZhangC10OpenAlexW2141658073WikidataQ58494670 ScholiaQ58494670MaRDI QIDQ990137

J. Martínez

Publication date: 2 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.11.012

zbMATH Keywords

combinatorial problemsBoolean rankSperner's theorembipartite covering

Mathematics Subject Classification ID

Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Strict group testing and the set basis problem

Cites Work

• On biclique coverings
• Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A set coverage problem