AUSTRIAN-POLISH 1997 Problem 8

Let $X$ be a set with $n$ elements. Find the largest number of subsets of $X$ , each with $3$ elements, so that no two of them are disjoint.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.