3 citations · 5 across the 5 of their papers we have counts for
1 paper · 1 filter
Adam S. Jobson, André E. Kézdy, Jenő Lehel
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…