ABSTRACT
The condition N(Sk) 2 k is clearly necessary for a perfect matching. If you have five pieces and only three players will accept some of them, it is certain in any assignment of pieces to players that at least two players will get unacceptable pieces. Showing the condition is sufficient is not so easy, but proofs can be found in most standard references on graph theory [CL], [Tuc].
