Highly Influenced

@article{Krivelevich2009AvoidingSS, title={Avoiding small subgraphs in Achlioptas processes}, author={Michael Krivelevich and Po-Shen Loh and Benny Sudakov}, journal={Random Struct. Algorithms}, year={2009}, volume={34}, pages={165-195} }

- Published 2009 in Random Struct. Algorithms
DOI:10.1002/rsa.20254

For a fixed integer r, consider the following random process. At each round, one is presented with r random edges from the edge set of the complete graph on n vertices, and is asked to choose one of them. The selected edges are collected into a graph, which thus grows at the rate of one edge per round. This is a natural generalization of what is known in the literature as an Achlioptas process (the original version has r = 2), which has been studied by many researchers, mainly in the context of… CONTINUE READING

Highly Cited

This paper has 32 citations. REVIEW CITATIONS

### Presentations referencing similar topics