Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
The paper discusses the maximum size of uniform intersecting families with prescribed covering number. The main result is a counterexample to a 20-year old conjecture of Lovász: it constructs a \(k\)-uniform intersecting family with covering number \(k\) whose size is greater than \(({k+ 1\over 2})^{k- 1}\).
scientific article; zbMATH DE number 883799