Richard P. Stanley Seminar in Combinatorics: Graph homomorphism inequalities

*Note: unusual time and location

We discuss recent progress on the study of a range of problems relating to homomorphism counts in graphs. Perhaps the most celebrated such problem is Sidorenko’s conjecture, which says that the number of copies of any fixed bipartite graph in another graph of given density is asymptotically minimised by the random graph. As well as talking about some of the recent results on this conjecture, we will touch on the positive graph conjecture and the study of norming graphs. If time permits, we will also say a little about similar problems in an arithmetic context.

For information about the Richard P. Stanley Seminar in Combinatorics, visit… https://math.mit.edu/combin/