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

DOI10.1016/j.dam.2008.05.006zbMath1229.05133MaRDI 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

hypergraph; pooling design; vertex-cover

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C65: Hypergraphs

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)