Geodesic
The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
The electronic journal of combinatorics, Tome 10 (2003)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let ${\bf F}_{3,2}$ denote the $3$-graph $\{abc,ade,bde,cde\}$. We show that the maximum size of an ${\bf F}_{3,2}$-free $3$-graph on $n$ vertices is $({4\over9}+o(1)) {n\choose3}$, proving a conjecture of Mubayi and Rödl [J. Comb. Th. A, 100 (2002), 135–152].
DOI : 10.37236/1711
Classification : 05C35, 05D05 
@article{10_37236_1711,
     author = {Zolt\'an F\"uredi and Oleg Pikhurko and Mikl\'os Simonovits},
     title = {The {Tur\'an} density of the hypergraph \(\{abc,ade,bde,cde\}\)},
     journal = {The electronic journal of combinatorics},
     year = {2003},
     volume = {10},
     doi = {10.37236/1711},
     zbl = {1011.05031},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1711/}
}
TY  - JOUR
AU  - Zoltán Füredi
AU  - Oleg Pikhurko
AU  - Miklós Simonovits
TI  - The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
JO  - The electronic journal of combinatorics
PY  - 2003
VL  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1711/
DO  - 10.37236/1711
ID  - 10_37236_1711
ER  - 
%0 Journal Article
%A Zoltán Füredi
%A Oleg Pikhurko
%A Miklós Simonovits
%T The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
%J The electronic journal of combinatorics
%D 2003
%V 10
%U http://geodesic.mathdoc.fr/articles/10.37236/1711/
%R 10.37236/1711
%F 10_37236_1711
Zoltán Füredi; Oleg Pikhurko; Miklós Simonovits. The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\). The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1711

Cité par Sources :