Full Seminar Archive

Our regular seminar program covers a broad range of topics from applied mathematics, pure mathematics and statistics. All staff and students are welcome. This page has a complete list of past seminars and a list restricted by year can be accessed via the left-hand menu.

Mike Steel - University of Canterbury
In the 161 years since Darwin’s Origin of Species, biologists have developed sophisticated ways to uncover and study the hidden shared ancestry of life from genomic data. While Darwin was able to...

Patrick Morris - Freie Universität Berlin, Berlin Mathematical School
An $(n,d,\lambda)$-graph is an $n$ vertex, $d$-regular graph with second eigenvalue in absolute value $\lambda$. When $\lambda$ is small compared to $d$, such graphs have \emph{pseudorandom}...

Rudi Mrazović - University of Zagreb
Hall and Paige conjectured in 1955 that a finite group G has a complete mapping (a permutation F such that xF(x) is also a permutation) if and only if it satisfies a straightforward necessary...

Sophie Spirkl - University of Waterloo
The Erdős-Hajnal conjecture states that for every graph $H$ there exists $c>0$ such that every $n$-vertex graph $G$ either contains $H$ as an induced subgraph, or has a clique or stable set of...

Rosalind Cameron - (University of Canterbury)
  The vertex-pursuit game of cops and robbers, introduced by Nowakowski and Winkler (1983), is played on a graph where a team of cops aim to occupy the same vertex as the robber. The cop number of a...

Vida Dujmović - University of Ottawa
I will talk about product structure theory of graphs and its application to various problems such as: graph adjacency encoding, queue/stack number and graph colourings.

Simone Linz - University of Auckland
Recent advances in whole-genome studies provide increasingly strong evidence for a vital role of hybridization in the evolution of certain groups of species and allowing them to adapt to new...

David Conlon - Caltech
The random algebraic method is a means of constructing examples in extremal combinatorics with some of the best properties of both algebraic constructions and probabilistic ones. This method has seen...

Tuan Tran - Institute for Basic Science
Let $Q_n$ be a random $n$ by $n$ matrix with entries in $\{0,1\}$ whose rows are independent vectors of exactly $n/2$ zero components. We show that the probability that $Q_n$ is singular is...

Tamás Makai - UNSW Sydney
Majority dynamics is a deterministic process on a graph which evolves in the following manner. Initially every vertex is coloured either red or blue. In each step of the process every vertex adopts...

Pages