|
|||||
|
|
Holes in random graphs |
|
| Authors: | Tomasz uczak |
| Institution: | Institute for Mathematics and its Applications, University of Minnesota, Minneapolis, USA |
| 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)→∞. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |