The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks

DOI10.1016/J.DAM.2008.05.006zbMath1229.05133OpenAlexW1969099006MaRDI QIDQ1003769

J. Martínez

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.05.006

zbMATH Keywords

hypergraphpooling designvertex-cover

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
• Nonrandom binary superimposed codes
• New constructions of non-adaptive and error-tolerance pooling designs
• Unnamed Item

This page was built for publication: The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks