Name
Abstract | ||
|---|---|---|
Let c be a positive constant. We show that if r = bcn1/3c and the members of (n) r are chosen sequentially at random to form an intersecting hypergraph then with limiting probability (1 +c3) 1 ,a sn !1 , the resulting family will be of maximum size n 1 r 1. |
Year | Venue | Field |
|---|---|---|
2003 | Electr. J. Comb. | Discrete mathematics,Combinatorics,Constraint graph,Hypergraph,Mathematics,Limiting |
DocType | Volume | Issue |
Journal | 10 | 1 |
Citations | PageRank | References |
3 | 0.82 | 4 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tom Bohman | 1 | 250 | 33.01 |
| Colin Cooper | 2 | 857 | 91.88 |
| Alan M. Frieze | 3 | 4837 | 787.00 |
| Ryan Martin | 4 | 144 | 14.43 |
| M. Ruszinkó | 5 | 230 | 35.16 |