Tue | Jun 08 | 23:00 | Ron Gould | Chorded cycles | |

Tue | Jun 08 | 22:00 | Andrew Suk | Turán-type problems for point-line incidences | |

Tue | Jun 08 | 21:00 | Fan Chung | Trees and forests in Green's functions of a graph | |

Tue | Jun 08 | 20:00 | David Conlon | Random multilinear maps and the Erdős box problem | |

Tue | Jun 08 | 19:00 | Jim Geelen | Homomorphisms and colouring for graphs and binary matroids | |

Tue | Jun 08 | 18:00 | Marcelo Campos | The singularity probability of a random symmetric matrix is exponentially small | |

Tue | Jun 08 | 17:00 | Allan Sly | Spread of infections in random walkers | |

Tue | Jun 08 | 16:00 | Jacob Fox | Removal lemmas | |

Tue | Jun 08 | 15:00 | James Davies | Colouring circle graphs and their generalisations | |

Tue | Jun 08 | 14:00 | Dhruv Mubayi | The feasible region of hypergraphs | |

Tue | Jun 08 | 13:00 | Deepak Bal | Size Ramsey numbers of paths and cycles | |

Tue | Jun 08 | 12:00 | Carla Groenland | Universal Graphs and Labelling Schemes | |

Tue | Jun 08 | 11:00 | László Lovász | Orthogonal representations and graph limits | |

Tue | Jun 08 | 10:00 | Noga Alon | Splitting Random Necklaces | |

Tue | Jun 08 | 09:00 | Annika Heckel | How does the chromatic number of a random graph vary? | |

Tue | Jun 08 | 08:00 | Heng Guo | A Markov chain approach towards the sampling Lovász local lemma | |

Tue | Jun 08 | 07:00 | Bartosz Walczak | Coloring polygon visibility graphs and their generalizations | |

Tue | Jun 08 | 06:00 | O-joung Kwon | Classes of intersection digraphs with good algorithmic properties | |

Tue | Jun 08 | 05:00 | Gordon Royle | Real chromatic roots of planar graphs | |

Tue | Jun 08 | 04:00 | Jeroen Schillewaert | Constructing highly regular expanders from hyperbolic Coxeter groups | |

Tue | Jun 08 | 03:00 | Baogang Xu | On coloring of graphs of girth 2l+1 without longer odd holes | |

Tue | Jun 08 | 02:00 | David Wood | Universality in Minor-Closed Graph Classes | |

Mon | Jun 08 | 23:00 | Ron Gould | Chorded cycles | |

Mon | Jun 08 | 22:00 | Andrew Suk | Turán-type problems for point-line incidences | |

Mon | Jun 08 | 21:00 | Fan Chung | Trees and forests in Green's functions of a graph | |

Mon | Jun 08 | 20:00 | David Conlon | Random multilinear maps and the Erdős box problem | |

Mon | Jun 08 | 19:00 | Jim Geelen | Homomorphisms and colouring for graphs and binary matroids | |

Mon | Jun 08 | 18:00 | Marcelo Campos | The singularity probability of a random symmetric matrix is exponentially small | |

Mon | Jun 08 | 17:00 | Allan Sly | Spread of infections in random walkers | |

Mon | Jun 08 | 16:00 | Jacob Fox | Removal lemmas | |

Mon | Jun 08 | 15:00 | James Davies | Colouring circle graphs and their generalisations | |

Mon | Jun 08 | 14:00 | Dhruv Mubayi | The feasible region of hypergraphs | |

Mon | Jun 08 | 13:00 | Deepak Bal | Size Ramsey numbers of paths and cycles | |

Mon | Jun 08 | 12:00 | Carla Groenland | Universal Graphs and Labelling Schemes | |

Mon | Jun 08 | 11:00 | László Lovász | Orthogonal representations and graph limits | |

Mon | Jun 08 | 10:00 | Noga Alon | Splitting Random Necklaces | |

Mon | Jun 08 | 09:00 | Annika Heckel | How does the chromatic number of a random graph vary? | |

Mon | Jun 08 | 08:00 | Heng Guo | A Markov chain approach towards the sampling Lovász local lemma | |

Mon | Jun 08 | 07:00 | Bartosz Walczak | Coloring polygon visibility graphs and their generalizations | |

Mon | Jun 08 | 06:00 | O-joung Kwon | Classes of intersection digraphs with good algorithmic properties | |

Mon | Jun 08 | 05:00 | Gordon Royle | Real chromatic roots of planar graphs (CMSA seminar) | |

Mon | Jun 08 | 04:00 | Jeroen Schillewaert | Constructing highly regular expanders from hyperbolic Coxeter groups | |

Mon | Jun 08 | 03:00 | Baogang Xu | On coloring of graphs of girth 2l+1 without longer odd holes | |

Mon | Jun 08 | 02:00 | David Wood | Universality in Minor-Closed Graph Classes | |