Theminimumnumberofe-vertex-coversamonghypergraphswithe edgesofgivenranks
Fei-Huang Chang, Hung‐Lin Fu, F. K. Hwang, Bingkai Lin · 2009
a b s t r a c t We study the problem that among all hypergraphs witheedges of ranksl1;:::;leand v vertices,whichhypergraphhastheleastnumberofvertex-coversofsizee.Theproblemis verydifficultandweonlygetsomepartialanswers.Weshowanapplicationofourresults toimprovetheerror-toleranceofapoolingdesignproposedintheliterature. '2008ElsevierB.V.Allrightsreserved.