# PC Seminar: Sparse Random Graphs with Many Triangles

- Date: 17 November 2022, 10:15–23:59
- Location: Ångström Laboratory, room 64119
- Type: Seminar
- Lecturer: Suman Chakraborty, Uppsala University
- Organiser: Matematiska institutionen
- Contact person: Tiffany Lo

Welcome to this seminar held by Suman Chakraborty, Uppsala University, with the title "Sparse Random Graphs with Many Triangles".

**Abstract: **It is well known that sparse random graphs (where the number of edges is of the order of the number of vertices) contain only a small number of triangles. On the other hand, many networks observed in real life are sparse but contain a large number of triangles. Motivated by this discrepancy we ask the following two questions: How (un)likely is it that a sparse random graph contains a large number of triangles? What does the graph look like when it contains a large number of triangles? We also ask a related question: What is the probability that in a sparse random graph a large number of vertices are part of some triangle? We discuss these questions, as well as some applications to exponential random graph models.

Joint work with Remco van der Hofstad and Frank den Hollander.

This is a seminar in our seminar series on Probability and Combinatorics (PC).