- Series
- Graph Theory Seminar
- Time
- Thursday, November 1, 2018 - 12:00pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Wojtek Samotij – Tel Aviv University
- Organizer
- Lutz Warnke

Let X denote the number of triangles in the random graph G(n, p). The problem of determining the asymptotics of the rate of the upper tail of X, that is, the function f_c(n,p) = log Pr(X > (1+c)E[X]), has attracted considerable attention of both the combinatorics and the probability communities. We shall present a proof of the fact that whenever log(n)/n << p << 1, then f_c(n,p) = (r(c)+o(1)) n^2 p^2 log(p) for an explicit function r(c). This is joint work with Matan Harel and Frank Mousset.