On the Turán number of the linear \(3\)-graph \(C_{13}\)
The electronic journal of combinatorics, Tome 29 (2022) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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 Gyárfás et. al., we show that for any crown-free linear $3$-graph $G$ on $n$ vertices, its number of edges satisfy $$\lvert E(G) \rvert \leq \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.
DOI : 10.37236/10775
Classification : 05C30, 05C35, 05C65, 05D05, 05B07
Mots-clés : linear Turán number for linear 3-graphs, Steiner triple systems, Erdős-Sós conjecture

Chaoliang Tang  1   ; Hehui Wu  2   ; Shengtong Zhang  3   ; Zeyu Zheng  1

1 School of Mathematical Sciences, Fudan University
2 Shanghai Center for Mathematical Sciences, Fudan University
3 Massachusetts Institute of Technology
@article{10_37236_10775,
     author = {Chaoliang  Tang and Hehui  Wu and Shengtong Zhang and Zeyu Zheng},
     title = {On the {Tur\'an} number of the linear \(3\)-graph {\(C_{13}\)}},
     journal = {The electronic journal of combinatorics},
     year = {2022},
     volume = {29},
     number = {3},
     doi = {10.37236/10775},
     zbl = {1496.05081},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/10775/}
}
TY  - JOUR
AU  - Chaoliang  Tang
AU  - Hehui  Wu
AU  - Shengtong Zhang
AU  - Zeyu Zheng
TI  - On the Turán number of the linear \(3\)-graph \(C_{13}\)
JO  - The electronic journal of combinatorics
PY  - 2022
VL  - 29
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/10775/
DO  - 10.37236/10775
ID  - 10_37236_10775
ER  - 
%0 Journal Article
%A Chaoliang  Tang
%A Hehui  Wu
%A Shengtong Zhang
%A Zeyu Zheng
%T On the Turán number of the linear \(3\)-graph \(C_{13}\)
%J The electronic journal of combinatorics
%D 2022
%V 29
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/10775/
%R 10.37236/10775
%F 10_37236_10775
Chaoliang  Tang; Hehui  Wu; Shengtong Zhang; Zeyu Zheng. On the Turán number of the linear \(3\)-graph \(C_{13}\). The electronic journal of combinatorics, Tome 29 (2022) no. 3. doi: 10.37236/10775

Cité par Sources :