Fix two integers n,k, with n divisible by k, and consider the following game played players, Waiter Client, on edges of Kn. Starting all marked as unclaimed, in each round, picks yet unclaimed edges. Client then chooses one these to be added Client's graph, while other edge is Waiter's graph. wins if she eventually forces create a Kk-factor If does not manage do that, wins. For fixed k large en...