The independence number
α(H) of a hypergraph
ed2216b1aac08a09" title="Click to view the MathML source">H is the maximum cardinality of a set of vertices of
ed2216b1aac08a09" title="Click to view the MathML source">H that does not contain an edge of
ed2216b1aac08a09" title="Click to view the MathML source">H. Generalizing Shearer’s classical lower bound on the independence number of triangle-free graphs Shearer (1991), and considerably improving recent results of Li and Zang (2006) and Chishti et al. (2014), we show that
for an
r-uniform linear triangle-free hypergraph
ed2216b1aac08a09" title="Click to view the MathML source">H with
r≥2, where