A
k‐uniform hypergraph with
n vertices is an
‐omitting system if it has no two edges with intersection size
. If in addition it has no two edges with intersection size greater than
, then it is an
‐system. Rödl and Šiňajová proved a sharp lower bound for the independence number of
...