Before revision:  Hence, every feasible allocation of items to the agents corresponds to a partial coloring , that is , a collection of pairwise disjoint independent sets.
After revision:  Every subset of items assigned to one agent has to form an independent set in this graph. Thus, the allocation of items to the agents corresponds to a partial coloring , that is , a collection of pairwise disjoint independent sets.