Name
Abstract | ||
|---|---|---|
Let G ( n, p ) be a graph on n vertices in which each possible edge is presented independently with probability p = p ( n ) and v 1 ( n, p ) denote the number of vertices of degree 1 in G ( n, p ). It is shown that if ε > 0 and np ( n )→∞ then the probability that G ( n, p ) contains cycles of all lengths r , 3⩽ r ⩽ n −(1+ ε ) v 1 ( n , p ), tends to 1 as n →∞. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0012-365X(91)90379-G | Discrete Mathematics |
Keywords | Field | DocType |
random graph | Discrete mathematics,Complete graph,Binomial distribution,Graph,Combinatorics,Random graph,Vertex (geometry),Cycle graph,Mathematics | Journal |
Volume | Issue | ISSN |
98 | 3 | Discrete Mathematics |
Citations | PageRank | References |
6 | 1.48 | 2 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomasz Łuczak | 1 | 225 | 40.26 |