Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths (Q397075): Difference between revisions

A collection \(\{F_{1},\dots ,F_{m}\}\) of sets is called a linear path of length \(m,\) \(P_{m},\) if \(| F_{i}\cap F_{i+1}| =1\) for \(i=1,\dots ,m-1,\) and \(F_{i}\cap F_{j}=\emptyset \) whenever \(| i-j| >1.\) In the paper, the maximum number of edges in a \(k\)-uniform hypergraph on \(n\) vertices not containing any \(P_{m}\) is determined for all \(m\geq 1\), \(k\geq 4,\) and sufficiently large \(n;\) the only extremal hypergraph is described as well.