An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs

MaRDI QIDQ7167390arXivFDO

Authors Marco Aldi, Thor Gabrielsen, Daniele Grandini, Joy Harris, Kyle Kelley

Publication date 2025

Published in arXiv

arXiv classification

math.CO

This page was built for publication: An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7167390)