The Turán number of F₃,3

DOI10.1017/S0963548311000678MaRDI QIDQ2888871zbMATH OpenFDO

Authors Peter Keevash, Dhruv Mubayi

Publication date 4 June 2012

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

\(F_{3,3}\)-free 3-graphmaximum number of edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Abstract: Let $F_{3,3}$ be the 3-graph on 6 vertices, labelled abcxyz, and 10 edges, one of which is abc, and the other 9 of which are all triples that contain 1 vertex from abc and 2 vertices from xyz. We show that for all $nge6$, the maximum number of edges in an $F_{3,3}$-free 3-graph on $n$ vertices is $$. This sharpens results of Zhou and of the second author and R"odl.

Recommendations

• The exact Turán number of F(3,3) and all extremal configurations
• The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
• The maximum number of triangles in \(F_k\)-free graphs
• The Turán number of the Fano plane
• On two Turán Numbers

Cites work

• A weighted generalization of Tur�n's theorem
• On the Turán number of triple systems
• Stability theorems for cancellative hypergraphs
• The maximum size of 3-uniform hypergraphs not containing a Fano plane
• Turán problems for integer-weighted graphs

Cited in

(12)

• The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
• The Turán number of the triangular pyramid of 3-layers
• On the Turán number of the linear \(3\)-graph \(C_{13}\)
• The Turán number of the Fano plane
• The exact Turán number of F(3,3) and all extremal configurations
• A hypergraph Turán theorem via Lagrangians of intersecting families
• The Turán Number of Berge K₄ in Triple Systems
• Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
• A hypergraph Turán theorem via Lagrangians of intersecting families
• Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
• An Andrásfai-Erdős-Sós type theorem for \(F_{3,3}\) in the \(\ell_2\)-norm
• An exact Turán result for tripartite 3-graphs

This page was built for publication: The Turán number of \(F_{3,3}\)

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