An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs
Marco Aldi, Thor Gabrielsen, Daniele Grandini, Joy Harris, Kyle ·2025-02-17·via math.CO updates on arXiv.org
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.