Caltech/UCLA Joint Analysis Seminar

The graph homomorphism density tH(G) is a measure of the number of copies of a fixed graph H in another graph G. In this talk, we survey recent work concerning inequalities between tH(G) and tK(G) for different graphs H and K, touching upon Sidorenko's conjecture, graph norms and related topics. Much of the material discussed is joint work with Joonkyung Lee.