Tuesday
9:00 - 10:00
Topological aspects of random graphs
10:00 - 10:30
coffee break and conference photo
Session 4A
Session 4B
The upper tail problem for induced 4-cycles in sparse random graphs
Simonovits’s Theorem in random graphs
Ramsey numbers of cycles in random graphs
The List-Ramsey Threshold
The number of n-queens configurations
The n-queens problem
On Symmetric Intersecting Families
Equiangular lines and regular graphs
13:00
lunch
15:00 - 16:00
Equiangular lines and eigenvalue multiplicities
16:00 - 16:30
coffee break
Session 5A
Session 5B
Session 5C
Transference for loose Hamilton cycles in random 3-uniform hypergraphs
Long paths and cycles in random hypergraphs and related algorithms
Cohomology groups of non-uniform random simplicial complexes
An improved lower bound on the length of the longest cycle in random graphs
Degree conditions for spanning hypergraphs
Cycle decompositions in k-uniform hypergraphs
Conflict-free hypergraph matchings
On a generalisation of Dirac’s Theorem to uniformly dense hypergraphs
An asymtotically optimal threshold bias for some (a : b) Maker-Breaker games
The (p:q)-Discrepancy Game in Hypergraphs
Multistage Maker-Breaker Game
The Potential Function Approach for Maker-Breaker Games