Name
Abstract | ||
|---|---|---|
We propose two procedures to choose members of ([n]/r) sequentially at random to form a non-trivially interesecting hypergraph. In both cases we show what is that limiting probability that if r = c(n)n(1/3) with c(n) -> c, then the process results in a Hilton-Milner-typer hypergraph. |
Year | Venue | Field |
|---|---|---|
2010 | ELECTRONIC JOURNAL OF COMBINATORICS | Discrete mathematics,Graph,Combinatorics,Colored,Degree (graph theory),Rainbow,Mathematics |
DocType | Volume | Issue |
Journal | 17 | 1.0 |
ISSN | Citations | PageRank |
1077-8926 | 13 | 1.25 |
References | Authors | |
5 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Balázs Patkós | 1 | 85 | 21.60 |