|
|||||
|
|
Upper tails for triangles |
|
| Authors: | B. DeMarco J. Kahn |
| Affiliation: | Department of Mathematics, Rutgers University, Piscataway, New Jersey 08854 |
| Abstract: | With ξ the number of triangles in the usual (Erd?s‐Rényi) random graph G(m,p), p > 1/m and η > 0, we show (for some Cη > 0)  This is tight up to the value of Cη. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 452–459, 2012 |
| Keywords: | upper tails large deviations random graphs subgraph counts |