The Turán Number ofF3,3

DOI10.1017/S0963548311000678zbMath1242.05131arXiv1102.2141MaRDI QIDQ2888871

Dhruv Mubayi, Peter Keevash

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

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

Mathematics Subject Classification ID

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

Related Items (3)

A hypergraph Turán theorem via Lagrangians of intersecting families ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs

Cites Work

• The maximum size of 3-uniform hypergraphs not containing a Fano plane
• On the Turán number of triple systems
• Stability theorems for cancellative hypergraphs
• Turán problems for integer-weighted graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4351314 A weighted generalization of Tur�n's theorem]

This page was built for publication: The Turán Number ofF_3,3