Combinatorics › Combinations and selections › Choosing with gaps
Minimum number of 7-subsets covering all triples
University · ●●●●○ 100 pts
Let . Choose subsets of such that: (i) for each ; (ii) for all ; (iii) for every 3-element subset of , there is some with . Find the minimum possible value of .