A family of r sets is called a 2-system if any two sets have the same intersection. Denote by F(n, r) the most number of subsets of an n-element set which do not contain a 2-system consisting of r sets. Constructive new lower bounds for F(n, r) are given which improve known probabilistic results, and a new upper bound is given by employing an argument due to Erdo s and Szemere di. Another construction is given which shows that for certain n, F(n, 3) 1.551 n&2 . We also show a relationship between the upper bound for F(n, 3) and the Erdo s Rado conjecture on the largest uniform family of sets not containing a 2-system.