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

*David Yost - Federation University Australia*

Taking as our domain the class of all polytopes with a given dimension and a given number of vertices, we begin with the optimisation questions: what is the minimum possible number of edges? What...

*Natasha Morrison - University of Cambridge*

One of the central objects of interest in additive combinatorics is the sumset $A + B := \{ a+b : a \in A, \, b \in B \}$ of two sets $A,B \subset \mathbb{Z}$. Our main theorem, which improves...

*Martin Golumbic - University of Haifa*

Graph sandwich problems are a prototypical example of checking consistency when faced with only partial data. A sandwich problem for a graph with respect to a graph property $\Pi$ is a partially...

*Dhruv Mubayi - University of Illinois at Chicago*

After a brief introduction to classical hypergraph Ramsey numbers, I will focus on the following problem. What is the minimum $t$ such that there exist arbitrarily large $k$-uniform hypergraphs...

*Bui Thi Hoa - Federation University Australia*

A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The first part of the talk we will establish that for any $d\ge 4$, the graph of a cubical $d$-polytope...

*Liana Yepremyan - Oxford University*

A central problem of extremal combinatorics is to determine the Turán number of a given graph or a hypergraph $F$, i.e. the maximum number of edges in an $r$-uniform hypergraph on $n$ vertices that...

*Faezeh Alizadeh - Shahid Rajaee Teacher Training University, Iran; and University of Western Australia*

Let $F$ be a field and $F^{r \times s}$ denote the space of $r \times s$ matrices over $F$. Let $K$ be an extension of $F$. Given matrices $A$ in $K^{r \times r}$ and $B$ in $K^{s \times s}$ we call...

*Ágnes Cseh - Hungarian Academy of Sciences*

Our input is a complete graph $G=(V,E)$ on $n$ vertices where each vertex has a strict ranking of all other vertices in $G$. Our goal is to construct a matching in $G$ that is popular. A matching $M...

*Ziyu Li - UNSW*

Given rules for substituting the edges of a graph by subgraphs, it is of interest to determine the properties of the resulting iterative graphs. One of the significant problems in this respect is to...

*Rutvik Oza - UNSW*

In the game of cops and robbers, the cops try to capture a robber moving on the vertices of the graph. Though the game is well studied on graphs, there are very few results on directed or oriented...