Upper Tails for Cliques
Probability
2012-11-12 v2 Combinatorics
Abstract
With the number of copies of in the usual (Erd\H{o}s-R\'enyi) random graph , and , we show when This is tight up to the value of the constant in the exponent.
Cite
@article{arxiv.1111.6687,
title = {Upper Tails for Cliques},
author = {Bobby DeMarco and Jeff Kahn},
journal= {arXiv preprint arXiv:1111.6687},
year = {2012}
}
Comments
25 pages