Geodesic
The Turán problem for hypergraphs on fixed size
The electronic journal of combinatorics, Tome 12 (2005)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
We obtain a general bound on the Turán density of a hypergraph in terms of the number of edges that it contains. If ${\cal F}$ is an $r$-uniform hypergraph with $f$ edges we show that $$\pi({\cal F}) < {f-2\over f-1} - \big(1+o(1)\big)(2r!^{2/r}f^{3-2/r})^{-1},$$ for fixed $r \geq 3$ and $f \rightarrow \infty$.
DOI : 10.37236/1978
Classification : 05D05, 05C65 
Peter Keevash. The Turán problem for hypergraphs on fixed size. The electronic journal of combinatorics, Tome 12 (2005). doi: 10.37236/1978
@article{10_37236_1978,
     author = {Peter Keevash},
     title = {The {Tur\'an} problem for hypergraphs on fixed size},
     journal = {The electronic journal of combinatorics},
     year = {2005},
     volume = {12},
     doi = {10.37236/1978},
     zbl = {1075.05084},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1978/}
}
TY  - JOUR
AU  - Peter Keevash
TI  - The Turán problem for hypergraphs on fixed size
JO  - The electronic journal of combinatorics
PY  - 2005
VL  - 12
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1978/
DO  - 10.37236/1978
ID  - 10_37236_1978
ER  - 
%0 Journal Article
%A Peter Keevash
%T The Turán problem for hypergraphs on fixed size
%J The electronic journal of combinatorics
%D 2005
%V 12
%U http://geodesic.mathdoc.fr/articles/10.37236/1978/
%R 10.37236/1978
%F 10_37236_1978

Cité par Sources :