Hypergraph independent set
= Hypergraph independent set
{title2=$E(H[I])=\varnothing$}
A subset $I$ of the vertices of a <hypergraph> is independent when no hyperedge lies wholly inside $I$. This generalizes an <independent set> in an ordinary <graph>. If a hypergraph has ordinary graph edges as its vertices and forbidden copies as its hyperedges, these independent sets encode graphs without those forbidden copies.