On the Vertex Cover Number of 3-Uniform Hypergraph  

作　　者：Zhuo Diao 

机构地区：[1]School of Statistics and Mathematics,Central University of Finance and Economics,Beijing 100081,China

出　　处：《Journal of the Operations Research Society of China》2021年第2期427-440,共14页中国运筹学会会刊（英文）

基　　金：This paper was supported by the National Natural Science Foundation of China (No. 11901605).

摘　　要：Given a hypergraph H(V,E),a set of vertices S⊆V is a vertex cover if every edge has at least one vertex in S.The vertex cover number is the minimum cardinality of a vertex cover,denoted byτ(H).In this paper,we prove that for every 3-uniform connected hypergraph H(V,E),τ(H)≤2m3+1/3 holds on where m is the number of edges.Furthermore,the equality holds on if and only if H(V,E)is a hypertree with perfect matching.

关 键 词：3-Uniform hypergraph Vertex cover HYPERTREE Perfect matching 

分 类 号：O15[理学—数学]