1 paper
Axel Brandt, David Irwin, Tao Jiang
Given a family of r-uniform hypergraphs F (or r-graphs for brevity), the Turán number ex(n,F) of F is the maximum number of edges in an r-graph on…