Given 7 elements, what is the most number of 3 element subsets that we can pick, such that any two subsets have exactly one point in common?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
[This is not a complete solution]
Many people are likely to think that the answer is 2 9 − 1 = 4 , where the sets share one element in common.
However, we can get 7 sets, by using the 7 points in the Fano plane (projective space), in which every 2 lines intersect at exactly one point.