The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
type: Item
instance of: scholarly article
title: The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
zbMATH Open document ID: 1011.05031
author: Oleg Pikhurko
author: Zoltán Füredi
author: Miklós Simonovits
published in: The Electronic Journal of Combinatorics
publication date: 2003-05-07T00:00:00Z
full work available at URL: v10i1r18.html
review text: Summary: Let \(F_{3,2}\) denote the \(3\)-graph \(\{abc,ade,bde,cde\}\). We show that the maximum size of an \(F_{3,2}\)-free \(3\)-graph on \(n\) vertices is \((\frac {4}{9}+ o(1)) {n \choose 3} \), proving a conjecture of \textit{D. Mubayi} and \textit{V. Rödl} [J. Comb. Theory, Ser. A 100, 136-152 (2000; Zbl 1009.05074)].
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05D05
zbMATH DE Number: 1907103
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1907103