MathDB
sets intersection

Source: Austrian Polish 2001

March 5, 2005
combinatorics proposedcombinatorics

Problem Statement

Let AA be a set with 2n2n elements, and let A1,A2...,AmA_1, A_2...,A_m be subsets of AAe ach one with n elements. Find the greatest possible m, such that it is possible to select these mm subsets in such a way that the intersection of any 3 of them has at most one element.
Back to ProblemsView on AoPS