- Series
- Graph Theory Seminar
- Time
- Tuesday, October 3, 2023 - 3:30pm for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Fan Wei – Duke University – fanw@princeton.edu – https://sites.google.com/view/fan-wei/home
- Organizer
- Tom Kelly

Fox et al introduced the model of c-closed graphs, a distribution-free model motivated by one of the most universal signatures of social networks, triadic closure. Even though enumerating maximal cliques in an arbitrary network can run in exponential time, it is known that for c-closed graph, enumerating maximal cliques and maximal complete bipartite graphs is always fast, i.e., with complexity being polynomial in the number of vertices in the network. In this work, we investigate further by enumerating maximal blow-ups of an arbitrary graph H in c-closed graphs. We prove that given any finite graph H, the number of maximal blow-ups of H in any c-closed graph on n vertices is always at most polynomial in n. When considering maximal induced blow-ups of a finite graph H, we provide a characterization of graphs H when the bound is always polynomial in n. A similar general theorem is also proved when H is infinite.