Question 1
In a communications network between two regions $A$ and $B$, there are $n$ stations in $A$ and $k$ stations in $B$. Every station in $A$ can communicate with at least $k-p$ stations in $B$. Prove that if $np\lt k$, at least one station in $B$ can communicate with every station in $A$.