Sparse Graphs Coalition

User Tools

Site Tools

Trace:
sessions:2021sessions:2021session2

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
sessions:2021sessions:2021session2 [2021/07/17 08:26] – ross.kangsessions:2021sessions:2021session2 [2023/09/22 15:12] (current) – [Organisers] ross.kang
Line 2: Line 2:
  
 Lovász local lemma, entropy compression, stochastic local search algorithms, cluster expansion, hard-core model, exponentially many hypergraph colourings, and related topics/techniques. Lovász local lemma, entropy compression, stochastic local search algorithms, cluster expansion, hard-core model, exponentially many hypergraph colourings, and related topics/techniques.
 +
 +==== Organisers ====
 +
 +[[https://staff.fnwi.uva.nl/j.r.kang/|Ross Kang]] and [[https://lbgi.fr/~sereni/|Jean-Sébastien Sereni]]
 +
  
 ==== Workshop dates ==== ==== Workshop dates ====
Line 100: Line 105:
  
   * Groenland, Kaiser, Treffers, Wales. Graphs of low average degree without independent transversals. https://arxiv.org/abs/2106.15175   * Groenland, Kaiser, Treffers, Wales. Graphs of low average degree without independent transversals. https://arxiv.org/abs/2106.15175
 +  * Davies, Illingworth. The χ-Ramsey problem for triangle-free graphs. https://arxiv.org/abs/2107.12288
 +  * Hurley, Pirot. A first moment proof of the Johansson-Molloy theorem. https://arxiv.org/abs/2109.15215
 +  * Hurley, Pirot. Uniformly Random Colourings of Sparse Graphs. https://arxiv.org/abs/2303.15367
  
  
sessions/2021sessions/2021session2.1626510381.txt.gz · Last modified: 2021/07/17 08:26 by ross.kang