Sparse Graphs Coalition

Algorithmic aspects of partition functions includes finding fast algorithms for counting combinatorial objects e.g. independent sets, matchings, colourings, and more generally approximately evaluating of their generating functions e.g. independence polynomial, matching polynomial, chromatic/Tutte polynomials /Potts model. This could include using Markov chain techniques, correlation decay, or the use of zero-free regions.

On the extremal side one is interested in maximising or minimising the polynomials above for various graph classes. Special cases of this would include questions finding the graph(s) that maximise/minimise e.g. the number of independent sets / matchings / proper colourings amongst graphs of a certain type, e.g. n-vertex d-regular graphs.

The aim of the workshop is to introduce participants to some of the available problems and techniques in this exciting area of research, to see connections between them, and to have fun working on some open problems together.

17-21 May 2021

• Viresh Patel (organiser)
• Guus Regts (organiser)

Registration details: tba

Registration deadline: tba

Submission details: tba

Submission deadline: tba

1. Monday, 17 May
  a. 
2. Tuesday, 18 May
  a. 
3. Wednesday, 19 May
  a. 
4. Thursday, 20 May
  a. 
5. Friday, 21 May
  a.