The answer is . Partition all but at most one point into disjoint pairs and take all unions of two pairs. There are such four-sets, and two distinct unions intersect in zero or two points. The Ray-Chaudhuri–Wilson theorem gives the upper bound .
The answer is . All four-sets containing one fixed pair form a family of size
whose distinct intersections have size two or three. The Ray-Chaudhuri–Wilson theorem for the two allowed intersection sizes gives the matching upper bound.
The answer is . Take a Steiner triple system, or a partial one of quadratic size, on and adjoin the fixed point to every triple. Distinct triples meet in zero or one point, so the resulting four-sets meet in one or two points. This gives members. The Ray-Chaudhuri–Wilson theorem with the two allowed intersection sizes gives .