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

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/27964

Title:	The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks
Authors:	Chang,FH;Fu,HL;Hwang,FK;Lin,BC
Contributors:	數學研究所
Date:	2009
Issue Date:	2010-06-29 19:39:03 (UTC+8)
Publisher:	中央大學
Abstract:	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.
Relation:	DISCRETE APPLIED MATHEMATICS
Appears in Collections:	[Graduate Institute of Mathematics] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	579	View/Open

社群 sharing