  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.
