@article{80abe787101345b0a166f8f3da36b2d5,
title = "Creating small subgraphs in achlioptas processes with growing parameter",
abstract = "We study the problem of creating a copy of some fixed graph H in the Achlioptas process on n vertices with parameter r, where r = r(n) is a growing function of n. We prove general upper and lower bounds on the threshold of this problem, and derive exact threshold functions for the case where H is a tree, a cycle, or the complete graph on four vertices.",
keywords = "Achlioptas process, Power of choices, Random graph, Small subgraph, Threshold",
author = "Michael Krivelevich and Reto Sp{\"o}hel",
year = "2012",
doi = "10.1137/110836146",
language = "אנגלית",
volume = "26",
pages = "670--686",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics (SIAM)",
number = "2",
}