Triangles in Random Graphs

Alexander Scott
University of Oxford

Let X be the number of triangles in a random graph G(n,1/2).
Loebl, Matousek and Pangrac showed that X is close to uniformly distributed modulo q when q=O(log n) is prime. We extend this result considerably, and discuss further implications of our methods for the distribution of the number of triangles in G(n,p). This is joint work with Atsushi Tateno (Oxford).

Back to Workshop I: Probabilistic Techniques and Applications