The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks (Q1003769)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks |
scientific article; zbMATH DE number 5523223
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks |
scientific article; zbMATH DE number 5523223 |
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
