The linear Turán number of the 3-graph $P_5$

Chaoliang Tang, Hehui Wu, Junchi Zhang

We prove that for any linear 3-graph on $n$ vertices without a path of length 5, the number of edges is at most $\frac{15}{11}n$, and the equality holds if and only if the graph is…