15 citations · 86 across the 50 of their papers we have counts for
1 paper · 1 filter
Peter Frankl
The aim of the present paper is to prove that the maximum number of edges in a 3-uniform hypergraph on n vertices and matching number s is max{\binom(3s+2,3), \binom(n,3) - \binom(…