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

標題:	The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks
作者:	Chang, F. H. Fu, H. L. Hwang, F. K. Lin, B. C. 應用數學系 Department of Applied Mathematics
關鍵字:	Vertex-cover;Hypergraph;Pooling design
公開日期:	6-一月-2009
摘要:	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.
URI:	http://dx.doi.org/10.1016/j.dam.2008.05.006 http://hdl.handle.net/11536/7757
ISSN:	0166-218X
DOI:	10.1016/j.dam.2008.05.006
期刊:	DISCRETE APPLIED MATHEMATICS
Volume:	157
Issue:	1
起始頁:	164
結束頁:	169
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。