MathDB
Set and subsets

Source: Austrian- Polish competition 1997

December 7, 2013
algorithmcombinatorics unsolvedcombinatorics

Problem Statement

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.
Back to ProblemsView on AoPS