The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks (Q1003769)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks |
scientific article |
Statements
The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks (English)
0 references
4 March 2009
0 references
vertex-cover
0 references
hypergraph
0 references
pooling design
0 references
