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

DOI10.1016/J.DAM.2008.05.006MaRDI QIDQ1003769zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Bounding the vertex cover number of a hypergraph
• Covering non-uniform hypergraphs
• On the vertex cover number of 3-uniform hypergraph
• On a problem of Erdős and Moser
• On covering numbers of regular hypergraphs

Cites work

• Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
• New constructions of non-adaptive and error-tolerance pooling designs
• Nonrandom binary superimposed codes
• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.

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

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