MathDB

8

Part of 1997 Austrian-Polish Competition

Problems(1)

Set and subsets

Source: Austrian- Polish competition 1997

12/7/2013
Let XX be a set with nn elements. Find the largest number of subsets of XX, each with 33 elements, so that no two of them are disjoint.
algorithmcombinatorics unsolvedcombinatorics