An independent set of a hypergraph is a subset of its vertices containing no complete hyperedge. Its
independence number is the largest size of such a set (Berge 1989). For
a 2-uniform hypergraph, this agrees with an independent
vertex set of an ordinary graph. This condition differs
from requiring that every two selected vertices lie in no common hyperedge.
Delcourt et al. (2026, Theorem 1.14) obtained a bound for sparse hypergraphs with edges of mixed sizes. Fix an integer and real constants
. There are constants
and
such that, for every
and every sufficiently large
depending on
,
the following holds. Let
have
vertices and all hyperedges
of size between 2 and
.
For
, let
be the maximum number of size-
hyperedges containing an
-subset
of vertices. If
|
(1)
|
|
(2)
|
for , and
|
(3)
|
for , then
|
(4)
|
The size restriction ,
the large-parameter requirements, and the separate bound on 2-element hyperedges
are part of the hypotheses.