This workshop, sponsored by AIM and the NSF, will be devoted to the study of graph homomorphism inequalities in all its aspects. This includes not only basic questions relating to subgraph counts in large graphs, but also problems regarding the number of independent sets and the number of colorings of graphs. We hope to bring together a broad selection of researchers to share ideas, perspectives and techniques for studying these problems.
The main topics for the workshop are
- Subgraph counts and related problems
- Interactions with statistical physics
- Flag algebras and other computational methods
This event will be run as an AIM-style workshop. Participants will be invited to suggest open problems and questions before the workshop begins, and these will be posted on the workshop website. These include specific problems on which there is hope of making some progress during the workshop, as well as more ambitious problems which may influence the future activity of the field. Lectures at the workshop will be focused on familiarizing the participants with the background material leading up to specific problems, and the schedule will include discussion and parallel working sessions.