Crowns in linear 3-graphs of minimum degree 4

DOI10.37236/11037MaRDI QIDQ2094887zbMATH OpenOpenAlexFDO

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

Publication date 8 November 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

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

zbMATH Keywords

Steiner triple systemsTurán number

Mathematics Subject Classification ID

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

Review text

Summary: A 3-graph is a pair \(H = (V, E)\) of sets, where elements of \(V\) are called points or vertices and \(E\) contains some 3-element subsets of \(V\), called edges. A 3-graph is called linear if any two distinct edges intersect in at most one vertex. There is a recent interest in extremal properties of 3-graphs containing no crown, three pairwise disjoint edges and a fourth edge which intersects all of them. We show that every linear 3-graph with minimum degree 4 contains a crown. This is not true if 4 is replaced by 3.

Recommendations

• On the Turán number of the linear \(3\)-graph \(C_{13}\)
• scientific article; zbMATH DE number 2107052
• The largest minimum codegree of a 3-graph without a generalized 4-cycle
• On 3-uniform hypergraphs without linear cycles
• Minimum degree of 3-graphs without long linear paths

Cites work

• An extension of Mantel's theorem to k-graphs
• scientific article; zbMATH DE number 1314686 (Why is no real title available?)
• Linear Turán numbers of acyclic triple systems
• On the Turán number of the linear \(3\)-graph \(C_{13}\)
• Turán and Ramsey numbers in linear triple systems

Cited in

(3)

• On the Turán number of the linear \(3\)-graph \(C_{13}\)
• Generalized crowns in linear r-graphs
• Bounds on linear Turán number for trees

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

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