Let A be a set with 2n elements, and let A1,A2...,Am be subsets of Ae ach one with n elements. Find the greatest possible m, such that it is possible to select these m subsets in such a way that the intersection of any 3 of them has at most one element. combinatorics proposedcombinatorics