Graph homomorphism inequalities

This AIM workshop, sponsored by AIM and the NSF, is devoted to graph homomorphism inequalities in all their aspects: basic questions about subgraph counts in large graphs as well as problems on the number of independent sets and the number of colourings of graphs. The main topics are subgraph counts and related problems, interactions with statistical physics, and flag algebras and other computational methods. Run as an AIM-style workshop, it invites participants to suggest open problems before the meeting, both specific problems where progress is possible during the week and more ambitious ones that may shape the field, and combines background lectures with discussion and parallel working sessions.