Consider the set X={1,2,3,4,5} and suppose you have two holes. Also suppose you have 10 pigeons: the 2-element subsets of X. Can you put these 10 pigeons into 2 holes in a way that there is no 3 element subset S={a,b,c} in X for which all the pigeons from S go in the same hole? Then answer the same question if X={1,2,3,4,5,6} with 15=C(6,2) pigeons.

Answer rating: 100% (QA)

Answer You have found out the 2 element subsets of X ie the pigeons Its count is always C n 2 whe... View the full answer