The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks
摘要
We study the problem that among all hypergraphs with e edges of ranks l(1), ..., l(e) an v vertices, which hypergraph has the least number of vertex-covers of size e. 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. (c) 2008 Elsevier B.V. All rights reserved.
所屬典藏
期刊論文引用此條目
Chang, F. H., Fu, H. L., Hwang, F. K., & Lin, B. C. (2009). The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks. DISCRETE APPLIED MATHEMATICS, 157(1), 164–169. https://doi.org/10.1016/j.dam.2008.05.006
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/7757