Geodesic
On hypergraphs with every four points spanning at most two triples
The electronic journal of combinatorics, Tome 10 (2003)

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

Zbl EuDML
Let ${\cal F}$ be a triple system on an $n$ element set. Suppose that ${\cal F}$ contains more than $(1/3-\epsilon){n\choose 3}$ triples, where $\epsilon>10^{-6}$ is explicitly defined and $n$ is sufficiently large. Then there is a set of four points containing at least three triples of ${\cal F}$. This improves previous bounds of de Caen and Matthias.
DOI : 10.37236/1750
Classification : 05C65, 05C35, 05D05 
Dhruv Mubayi. On hypergraphs with every four points spanning at most two triples. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1750
@article{10_37236_1750,
     author = {Dhruv Mubayi},
     title = {On hypergraphs with every four points spanning at most two triples},
     journal = {The electronic journal of combinatorics},
     year = {2003},
     volume = {10},
     doi = {10.37236/1750},
     zbl = {1023.05105},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1750/}
}
TY  - JOUR
AU  - Dhruv Mubayi
TI  - On hypergraphs with every four points spanning at most two triples
JO  - The electronic journal of combinatorics
PY  - 2003
VL  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1750/
DO  - 10.37236/1750
ID  - 10_37236_1750
ER  - 
%0 Journal Article
%A Dhruv Mubayi
%T On hypergraphs with every four points spanning at most two triples
%J The electronic journal of combinatorics
%D 2003
%V 10
%U http://geodesic.mathdoc.fr/articles/10.37236/1750/
%R 10.37236/1750
%F 10_37236_1750

Cité par Sources :