An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.