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édi 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.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。