Geodesic
On randomly generated non-trivially intersecting hypergraphs
The electronic journal of combinatorics, Tome 17 (2010)

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

Zbl EuDML
We propose two procedures to choose members of ${[n] \choose r}$ sequentially at random to form a non-trivially intersecting hypergraph. In both cases we show what is the limiting probability that if $r=c_nn^{1/3}$ with $c_n \rightarrow c$, then the process results in a Hilton-Milner-type hypergraph.
DOI : 10.37236/298
Classification : 05C65, 05C85, 05C80, 05D05, 05D40
Mots-clés : intersecting hypergraphs, Hilton Milnor type hypergraph 
Balázs Patkós. On randomly generated non-trivially intersecting hypergraphs. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/298
@article{10_37236_298,
     author = {Bal\'azs Patk\'os},
     title = {On randomly generated non-trivially intersecting hypergraphs},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/298},
     zbl = {1193.05122},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/298/}
}
TY  - JOUR
AU  - Balázs Patkós
TI  - On randomly generated non-trivially intersecting hypergraphs
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/298/
DO  - 10.37236/298
ID  - 10_37236_298
ER  - 
%0 Journal Article
%A Balázs Patkós
%T On randomly generated non-trivially intersecting hypergraphs
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/298/
%R 10.37236/298
%F 10_37236_298

Cité par Sources :