Supersaturation of subgraphs

Graph Theory Seminar
Tuesday, March 28, 2023 - 3:45pm for 1 hour (actually 50 minutes)
Skiles 005
Tao Jiang – Miami University – jiangt@miamioh.edu
Tom Kelly

Many results in extremal graph theory build on supersaturation of subgraphs. In other words, when a graph is dense enough, it contains many copies of a certain subgraph and these copies are then used as building blocks to force another subgraph of interest. Recently more success is found within this approach where one utilizes not only the large number of copies of a certain subgraph but a well-distributed collection of them to force the desired subgraph. We discuss some recent progress of this nature. The talk is built on joint work with Sean Longbrake, and with Sean Longbrake and Jie Ma.