|
|
|
|
|
|
by holden_nelson
962 days ago
|
|
|
I read the second example as: every set contains some elements that are totally unique to that set, and also some elements that are common to all of the sets, and nothing else. So I think it is a sunflower - any pairwise intersection just has the shared elements. e.g 100 sets of integers, of size 3. Each set contains a unique number from 1-100, and every set also contains 1000 and 10000. Any pairwise intersection is {1000, 10000}. |
|
|