On the Turán number of the linear 3-graph C₁₃

DOI10.37236/10775zbMATH Open1496.05081arXiv2109.10520OpenAlexW4297724415MaRDI QIDQ2170802FDOQ2170802

Authors: Chaoliang Tang, Hehui Wu, Shengtong Zhang, Zeyu Zheng 

Publication date: 6 September 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: Let the crown $C_{13}$ be the linear $3$-graph on $9$ vertices $a,b,c,d,e,f,g,h,i$ with edges ${\displaystyle }$E = {{a,b,c}, {a, d,e}, {b, f, g}, {c, h,i}}.${\displaystyle }$ Proving a conjecture of Gy'arf'as et. al., we show that for any crown-free linear $3$-graph $G$ on $n$ vertices, its number of edges satisfy ${\displaystyle }$lvert E(G) vert leq frac{3(n - s)}{2}${\displaystyle }$ 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'an number for linear $3$-graphs with at most $4$ edges.

Full work available at URL: https://arxiv.org/abs/2109.10520

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Crowns in linear \(3\)-graphs of minimum degree \(4\)
• Turán numbers for 3-uniform linear paths of length 3
• Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
• The Turán number of \(F_{3,3}\)
• The exact linear Turán number of the sail

zbMATH Keywords

Steiner triple systemsErdős-Sós conjecturelinear Turán number for linear 3-graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Hypergraphs (05C65) Extremal set theory (05D05) Triple systems (05B07)

Cites Work

• Linear Turán numbers of acyclic triple systems

Cited In (1)

• Crowns in linear \(3\)-graphs of minimum degree \(4\)

This page was built for publication: On the Turán number of the linear \(3\)-graph \(C_{13}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170802)