All lectures will take place in the International Centre for Mathematical Sciences (ICMS) on the top floor of the Bayes Centre. Coffee, tea and lunches will take place outside the lecture theatre.
There is a pdf file containing all the abstracts here.
Thursday 25th April
9:45 - 10:25 | Coffee/Tea |
10:25 - 10:30 | Welcome |
10:30 - 11:15 |
Stephen Finbow (St Francis Xavier University) The Firefighter problem on graphs |
11:20 - 12:45 | Early career short talks (3) |
Benjamin Bumpus (University of Glasgow):
The Width of Minimum Cost Tree Decompositions |
|
Padraig Condon (University of Birmingham):
Resilience of random graphs with respect to Hamiltonicity |
|
Matthew Coulson (University of Birmingham): On the largest component of the critical random digraph | |
12:45 - 13:45 | Lunch |
13:45 - 14:30 |
Kurt Melhorn (MPI Saarbrucken) The Complexity of a Variant of Mastermind |
14:35 - 15:25 | Short talks (2) |
Konrad Dabrowski
(Durham University): Graph Isomorphism for (H_1,H_2)-free
Graphs: An Almost Complete Dichotomy |
|
David Bevan (University of Strathclyde): The local structure of semi-sparse permutations | |
15:25 - 15:50 | Coffee/Tea |
15:50 - 16:35 |
Julia Böttcher (London School of Economics) Spanning subgraphs of randomly perturbed graphs |
16:35 - 17:00 | Early career short talk |
Elena Zamaraeva (University of Warwick):
On the number of 2-threshold functions |
Friday 26th April
9:45 - 10:30 |
Gary McGuire (University College Dublin) The Number of Roots of a Linearized Polynomial |
10:30 - 11:00 | Coffee/Tea |
11:00 - 11:45 |
Daniela Kühn
(University of Birmingham) The Oberwolfach problem |
11:45 - 13:05 | Early career short talks (3) |
Rachel Kirsch
(London School of Economics): Many cliques with few edges |
|
Alexander Levine (Heriot-Watt University): Counting Elements of Thompson's group F | |
Grahame Erskine (Open University): Upper embeddings of symmetric configurations with block size 3 | |
13:05 - 14:00 | Lunch |
14:00 - 14:45 |
Guus Regts (University of Amsterdam) On the location of zeros of the independence polynomial of bounded degree graphs |
14:45 - 15:30 | Nik Ruškuc (University of
St Andrews) Decidability of the WQO problem for permutations under the consecutive pattern involvement |
15:30 - 16:00 | Coffee/Tea |
16:00 - 16:45 | Early career short talks (2) |
Sofiat
Olamiji Olaosebikan
(University of Glasgow): Strongly Stable Matchings in
the Student Project Allocation Problem with Ties |
|
Luca Zanetti (University of Cambridge) Hermitian Laplacians, Cheeger inequalities, and 2-variable linear equations |