Triangle read by rows: T(n,r) is maximal such that there exists a family F of subsets of {1,...,n} of size T(n,r) such that the intersection of no two sets in F has r elements.
For fixed r and n(r) sufficiently large Frankl and Füredi proved that T(n,r) is maximized by taking F such that for all A in F: |A| > (n+r)/2 or |A| < r when n+r is odd, and|A\{1}| >= (n+r)/2 or |A| < r when n+r is even.
