Holes in random graphs


tuczak, T., Holes in random graphs, Discrete Applied Mathematics 30 (1991) 213-219. It is shown that for every E>O with the probability tending to 1 as n-00 a random graph G(n,p) contains induced cycles of all lengths k, 3 <k~ (1 &)n log C/C, provided c(n) = (n l)p(n)-a.

DOI: 10.1016/0166-218X(91)90045-X

Cite this paper

@article{Luczak1991HolesIR, title={Holes in random graphs}, author={Tomasz Luczak}, journal={Discrete Applied Mathematics}, year={1991}, volume={30}, pages={213-219} }