The minimum number of image-vertex-covers among hypergraphs with image edges of given ranks Original Research Article

We study the problem that among all hypergraphs with image edges of ranks image and image vertices, which hypergraph has the least number of vertex-covers of size image. The problem is very difficult and we only get some partial answers. We show an application of our results to improve the error-tolerance of a pooling design proposed in the literature.