Name
Abstract | ||
|---|---|---|
It is shown that for every ε>0 with the probability tending to 1 as n →∞ a random graph G ( n,p ) contains induced cycles of all lengths k , 3 ≤ k ≤ (1 − ε) n log c/c , provided c ( n ) = ( n − 1) p ( n )→∞. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0166-218X(91)90045-X | Discrete Applied Mathematics |
Keywords | DocType | Volume |
random graph | Journal | 30 |
Issue | ISSN | Citations |
2 | Discrete Applied Mathematics | 0 |
PageRank | References | Authors |
0.34 | 1 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomasz Łuczak | 1 | 225 | 40.26 |