Let
be integers. Define a bipartite graph between all
-element and all
-element subsets
of an
-element
set by drawing an edge if and only if the first one contains the second.
The domination number of this graph is determined up to a factor of
. The
short proof relies on some extremal results concerning hypergraphs.