Geodesic
On randomly generated intersecting hypergraphs
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 $c$ be a positive constant. We show that if $r=\lfloor{cn^{1/3}}\rfloor$ and the members of ${[n]\choose r}$ are chosen sequentially at random to form an intersecting hypergraph then with limiting probability $(1+c^3)^{-1}$, as $n\to\infty$, the resulting family will be of maximum size ${n-1\choose r-1}$.
DOI : 10.37236/1722
Classification : 05D05, 05D40 
@article{10_37236_1722,
     author = {Tom Bohman and Colin Cooper and Alan Frieze and Ryan Martin and Mikl\'os Ruszink\'o},
     title = {On randomly generated intersecting hypergraphs},
     journal = {The electronic journal of combinatorics},
     year = {2003},
     volume = {10},
     doi = {10.37236/1722},
     zbl = {1023.05129},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1722/}
}
TY  - JOUR
AU  - Tom Bohman
AU  - Colin Cooper
AU  - Alan Frieze
AU  - Ryan Martin
AU  - Miklós Ruszinkó
TI  - On randomly generated intersecting hypergraphs
JO  - The electronic journal of combinatorics
PY  - 2003
VL  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1722/
DO  - 10.37236/1722
ID  - 10_37236_1722
ER  - 
%0 Journal Article
%A Tom Bohman
%A Colin Cooper
%A Alan Frieze
%A Ryan Martin
%A Miklós Ruszinkó
%T On randomly generated intersecting hypergraphs
%J The electronic journal of combinatorics
%D 2003
%V 10
%U http://geodesic.mathdoc.fr/articles/10.37236/1722/
%R 10.37236/1722
%F 10_37236_1722
Tom Bohman; Colin Cooper; Alan Frieze; Ryan Martin; Miklós Ruszinkó. On randomly generated intersecting hypergraphs. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1722

Cité par Sources :