On the Turán number of the linear \(3\)-graph \(C_{13}\) (Q2170802)

Summary: Let the crown \(C_{13}\) be the linear \(3\)-graph on \(9\) vertices \(\{a,b,c,d,e,f,g,h,i\}\) with edges \[E = \{\{a, b, c\}, \{a, d, e\}, \{b, f, g\}, \{c, h, i\}\}.\] Proving a conjecture of \textit{A. Gyárfás} et al. [Eur. J. Comb. 99, Article ID 103435, 12 p. (2022; Zbl 1476.05080)], we show that for any crown-free linear \(3\)-graph \(G\) on \(n\) vertices, its number of edges satisfy \[\vert E(G) \vert \leqslant \frac{3(n - s)}{2}\] where \(s\) is the number of vertices in \(G\) with degree at least \(6\). This result, combined with previous work, essentially completes the determination of linear Turán number for linear \(3\)-graphs with at most \(4\) edges.