Suppose we have ten basketball teams, for any group of three teams we know at least two teams have not played each other. Let S be the largest set of teams such that none have played each other. Provide, with proof, the largest integer n satisfying |S| ≥ n.
Can't choose a particular matching of...