On randomly generated non-trivially intersecting hypergraphs (Q2380458)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On randomly generated non-trivially intersecting hypergraphs |
scientific article; zbMATH DE number 5687008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On randomly generated non-trivially intersecting hypergraphs |
scientific article; zbMATH DE number 5687008 |
Statements
On randomly generated non-trivially intersecting hypergraphs (English)
0 references
26 March 2010
0 references
Summary: We propose two procedures to choose members of \(\binom{[n]}{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_n n^{1/3}\) with \(c_n \rightarrow c\), then the process results in a Hilton-Milner-type hypergraph.
0 references
intersecting hypergraphs
0 references
Hilton Milnor type hypergraph
0 references
0.8875876069068909
0 references
0.8865463137626648
0 references
0.8426643013954163
0 references
0.7499355673789978
0 references
0.7496936321258545
0 references
