Another user asked the following question:
"How can I determine the size of the largest collection of $k$-element subsets of an $n$-element set such that each pair of subsets has at most $m$ elements in common?"
The top answer to this question gives upper and lower bounds. Has anyone calculated the exact solutions to this problem for small values of the parameters? In particular, I am interested in $k=3$, $m=1$, and various values of $n$. Is there a table of solutions available anywhere?