The order of the largest complete minor in a random graph
Combinatorics
2007-05-23 v1 Probability
Abstract
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let G(n,p) denote a random graph on n vertices with edge probability p. Bollobas, Catlin and Erdos asymptotically determined ccl(G (n,p)) when p is a constant. Luczak, Pittel and Wierman gave bounds on ccl(G(n,p)) when p is very close to 1/n, i.e. inside the phase transition. Extending the results of Bollobas, Catlin and Erdos, we determine ccl(G(n,p)) quite tightly, for p>C/n where C is a large constant. If p=C/n, for an arbitrary constant C>1, then we show that asymptotically almost surely ccl(G (n,p)) is of order square-root of n. This answers a question of Krivelevich and Sudakov.
Keywords
Cite
@article{arxiv.0705.0325,
title = {The order of the largest complete minor in a random graph},
author = {N. Fountoulakis and D. Kühn and D. Osthus},
journal= {arXiv preprint arXiv:0705.0325},
year = {2007}
}
Comments
14 pages