The Szemerédi-Petruska conjecture for a few small values

Adam S. Jobson, André E. Kézdy, Jenő Lehel

Published 2020-10-02Version 1

Let H be a 3-uniform hypergraph of order n with clique number k such that the intersection of all maximum cliques of H is empty. For fixed m=n-k, Szemer\'edi and Petruska conjectured the sharp bound $n\leq {m+2\choose 2}$. In this note the conjecture is verified for m=2,3 and 4.