Friday
Session 9A
Session 9B
Multicolor Turán numbers
Hypergraphs with minimum positive uniform Turán density
Analysing random structures using the Warning Propagation algorithm
Symmetric Binary Perceptron Model: Algorithms and Barriers
10:00 - 10:30
coffee
Session 10A
Session 10B
The Turán density of three-uniform tight cycles
The Turán number of the grid
The The Erdős-Gyárfás function $f(n, 4, 5) = \frac{5}{6}n + o(n)$ (so Gyárfás was right)
Erdős’s conjecture on pancyclicity of Hamiltonian graphs
Graphs With Large Minimum Degree and No Small Odd Cycles Are Three Colourable
The 1-2-3 Conjecture – recent progresses
Local Computation Algorithms for Coloring of Uniform Hypergraphs
Defective colouring of hypergraphs
13:00
lunch
Session 11A
Session 11B
Session 11C
Clique packings in random graphs
Anticoncentration via the strong perfect graph theorem
Graph flip processes
There are at most O(m^0.31m) non-isomorphic combinatorial 3-spheres with m faces
16:00 - 16:30
coffee
16:30 - 17:30
On two point concentration of the independence number of G_{n,p}
18:00
dormitory cafeteria
FAREWELL PARTY