Programme

All times are UK summer time (BST).

The programme with the abstracts can be found here.

Wednesday 8 May - All lectures will be in the Chemistry Lecture Theatre XLG1 in the Christopher Ingold Building, UCL (see this map). 

10:00

Tea/coffee in North Cloisters

10:30

 

Paul Balister (University of Oxford)

Counting graphic sequences via integrated random walks

11:20

 

Candy Bowtell (University of Warwick)

Matchings in multipartite hypergraphs

12:10

Lunch break

13:40

 

Marcelo Campos (University of Cambridge)

New Lower Bounds for Sphere Packing

14:30

 

Jinyoung Park (Courant Institute)

Lipschitz functions on expanders

15:20

Coffee break in North Cloisters

15:50

 

Gal Kronenberg (University of Oxford)

Balanced edge- and vertex-partitions of cubic graphs

16:40

 

László Végh (LSE)

A strongly polynomial algorithm for the minimum-cost generalized flow problem

Thursday 9 May - All lectures will be in the Sheikh Zayed Theatre, Cheng Kin Ku Building, LSE (CKK building on this map)

10:00

Tea/coffee

10:30

 

Yoshi Kohayakawa (University of São Paulo)

Arithmetic progressions in sumsets and in subsetsums of sparse random sets

11:20

 

Anurag Bishnoi (Delft University of Technology)

Linear trifferent codes

12:10

Lunch break

13:40

 

Jo Ellis-Monaghan (University of Amsterdam)

Combinatorial, topological, and computational approaches to DNA self-assembly

14:30

 

Nemanja Draganić (University of Oxford)

Hamiltonicity of expanders: optimal bounds and applications

15:20

Coffee break

15:50

 

Kristina Vušković (University of Leeds)

Structure and algorithms for even-hole-free graphs

16:40

 

Alan Sokal (UCL)

Coefficientwise Hankel-total positivity in enumerative combinatorics

17:45

Reception