1

For some positive integer $n$, we are given $n^2$ subsets of a ground set, where every element appears in at most $n$ sets. Any element appearing in exactly $n$ sets is called "maximum". We want to determine whether we can choose at most $n-1$ elements so that for any maximum element, at least on...