An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs
Combinatorics
2025-02-18 v1
Abstract
We introduce a lower bound for the independence number of an arbitrary -uniform hypergraph that only depends on the number of vertices and number of edges of the hypergraph.
Keywords
Cite
@article{arxiv.2502.11814,
title = {An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs},
author = {Marco Aldi and Thor Gabrielsen and Daniele Grandini and Joy Harris and Kyle Kelley},
journal= {arXiv preprint arXiv:2502.11814},
year = {2025}
}
Comments
5 pages