More on maximal intersecting families of finite sets (Q1086235)

A collection of k-sets is called a k-clique if any two sets intersect. A k-clique is maximal if no new k-set can be added so that the result is still a k-clique. The author shows that if m(k) is the minimal number of k-sets in a maximal k-clique then (i) m(k)\(\leq k^ 5\) for all k and (ii) m(k)\(\leq \frac{3}{4}k^ 2+\frac{3}{2}k-1\) if k is a prime power.