Exact Solution of the Hypergraph Turán Problem for k-Uniform Linear Paths: For k ≥ 4 and Large n, the Turán Numbers of P_{2t+1} and P_{2t+2} and Their Unique Extremal FamiliesResearch Paper
Hypergraph Turán problems ask how many edges a -uniform hypergraph on vertices can have without containing a fixed sub-hypergraph. For graphs () the theory is well developed; for exact answers are rare and are known mostly for small, dense configurations such as the Fano plane or expanded triangles. Paths are the natural sparse test case. For…