Transversals and Independence in Linear Hypergraphs with Maximum Degree Two

[摘要] For $k \ge 2$, let $H$ be a $k$-uniform hypergraph on $n$ vertices and $m$ edges. Let $S$ be a set of vertices in a hypergraph $H$. The set $S$ is a transversal if $S$ intersects every edge of $H$, while the set $S$ is strongly independent if no two verti

[学科分类] 离散数学和组合数学

[关键词] Transversal;Hypergraph;Linear hypergraph;Strong independence