A sharp upper bound for the independence number

Peter Borg

An $r$-graph $G$ is a pair $(V,E)$ such that $V$ is a set and $E$ is a family of $r$-element subsets of $V$. The \emph{independence number} $\alpha (G)$ of $G$ is the size of a largest s…