Extremal Problems for Hypergraph Blowups of Trees
Extremal Problems for Hypergraph Blowups of Trees
We study the extremal number for paths in -uniform hypergraphs where two consecutive edges of the path intersect alternately in sets of sizes and with and all other pairs of edges have empty intersection. Our main result, which is about hypergraphs that are blowups of trees, determines asymptotically the extremal …