Santa Claus has at least n gifts for n children. For i∈{1,2,...,n}, the i-th child considers xi>0 of these items to be desirable. Assume that
x11+⋯+xn1≤1.
Prove that Santa Claus can give each child a gift that this child likes. inductiongraph theorycombinatoricsmatchingsHall s marriage theorem