An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs

Marco Aldi, Thor Gabrielsen, Daniele Grandini +2

Let $k\ge 2$ be fixed. We study the integer lower bound $\ell (G)$ obtained by inverting the classical counting inequality for Turán systems. For a $k$-uniform hypergraph with $n$ ve…