On Upper Transversals in 3-Uniform Hypergraphs

Electronic Journal Of Combinatorics

Michael A. Henning¹ 

关键词: Transversal;    Upper transversal;    3-uniform hypergraph;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A set $S$ of vertices in a hypergraph $H$ is a transversal if it has a nonempty intersection with every edge of $H$. The upper transversal number $\Upsilon(H)$ of $H$ is the maximum cardinality of a minimal transversal in $H$. We show that if $H$ is a con

【 授权许可】

Others