An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs

We introduce a lower bound for the independence number of an arbitrary $k$-uniform hypergraph that only depends on the number of vertices and number of edges of the hypergraph.