UVictoria Discrete Math Seminar: Hao Chen

Many fundamental problems in extremal combinatorics can be expressed as inequalities in graph homomorphism densities. In this talk, I will introduce some new results on this topic. Our research involves Sidorenko's conjecture, Kohayakawa-Nagle-R{\"o}dl-Schacht conjecture and common graphs. Moreover, I will share some recent advancements in problems of homomorphism densities for tournaments.