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

DOI10.37236/11037zbMath1503.05065OpenAlexW4306976805MaRDI QIDQ2094887

Jing Guo, Rona Wang, Shiyu Yan, Willem Fletcher, Alvaro Carbonero, András Gyárfás

Publication date: 8 November 2022

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

Full work available at URL: https://doi.org/10.37236/11037

zbMATH Keywords

Steiner triple systemsTurán number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On the Turán number of the linear \(3\)-graph \(C_{13}\)
• Turán and Ramsey numbers in linear triple systems
• Linear Turán numbers of acyclic triple systems
• An Extension of Mantel’s Theorem to k-Graphs

This page was built for publication: Crowns in linear \(3\)-graphs of minimum degree \(4\)