# 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.

*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...

*Annika Heckel - LMU Munich*

There are many impressive results asserting that the chromatic number of a random graph is sharply concentrated. In 1987, Shamir and Spencer showed that for any function $p=p(n)$, the chromatic...

*Katherine Staden - University of Oxford*

In a graph decomposition problem, the goal is to partition the edge set of a host graph into a given set of pieces. I will focus on the setting where the host graph and the pieces have a comparable...

*Daniel Horsley - Monash University*

Let S be a collection of derangements (fixed point-free permutations) of a possibly infinite set X. The derangement action digraph DA(X,S) is the digraph on vertex set X that has an arc from x to y...

*Tibor Szabó - Freie Universität Berlin*

The Turán number of a (hyper)graph $H$, defined as the maximum number of (hyper)edges in an $H$-free (hyper)graph on a given number of vertices, is a fundamental concept of extremal combinatorics....

*Brendan McKay - ANU*

Over the centuries, many claims have been made of numerical patterns of miraculous nature hidden within the text of sacred writings, including the Jewish, Christian and Islamic scriptures. Usually...