It follows from the ellipsoid method and results of Grotschel, Lovasz and Schrijver that one can find an optimal colouring of a perfect graph in polynomial time. But no ''combinatorial'' algorithm to do this is known.

Here we give a combinatorial algorithm to do this in an n-vertex perfect graph in time O(n^{k+1}^2) where k is the clique number; so polynomial-time for fixed k. The algorithm depends on another result, a polynomial-time algorithm to find a ''balanced skew partition'' in a perfect graph if there is one.

Joint work with Maria Chudnovsky, Aurelie Lagoutte, and Sophie Spirkl.

For a graph $G$, the $k$-colour Ramsey number $R_k(G)$ is the least integer $N$ such that every $k$-colouring of the edges of the complete graph $K_N$ contains a monochromatic copy of $G$. Let $C_n$ denote the cycle on $n$ vertices. We show that for fixed $k\geq2$ and $n$ odd and sufficiently large,
$$
R_k(C_n)=2^{k-1}(n-1)+1.
$$
This resolves a conjecture of Bondy and Erdős for large $n$. The proof is analytic in nature, the first step of which is to use the regularity method to relate this problem in Ramsey theory to one in nonlinear optimisation.  This allows us to prove a stability-type generalisation of the above and establish a correspondence between extremal $k$-colourings for this problem and perfect matchings in the $k$-dimensional hypercube $Q_k$.

In joint work with Olof Sisask, we establish new quantitative bounds for Roth's theorem on arithmetic progressions, showing that a set of integers with no three-term arithmetic progressions must have density O(1/(log N)^{1+c}) for some absolute constant c>0. This is the integer analogue of a result of Bateman and Katz for the model setting of vector spaces over a finite field, and the proof follows a similar structure. 

The threshold for existence of a giant component in a random graph with given vertex degrees was found by Molloy and Reed (1995), and several authors have since studied the size of the largest and other components in various cases. The critical window was found by Hatami and Molloy (2012), and has a width that depends on whether the asymptotic degree distribution has a finite third moment or not. I will describe some new results (joint work with Remco van der Hofstad and Malwina Luczak) on the barely supercritical case, where this difference between finite and infinite third moment also is seen.

'Erdős-Ko-Rado type problems' are well-studied in extremal combinatorics; they concern the sizes of families of objects in which any two (or any $r$) of the objects in the family 'agree', or 'intersect', in some way.

If $X$ is a finite set, the '$p$-biased measure' on the power-set of $X$ is defined as follows: choose a subset $S$ of $X$ at random by including each element of $X$ independently with probability $p$. If $\mathcal{F}$ is a family of subsets of $X$, one can consider the $p$-biased measure of $\mathcal{F}$, denoted by $\mu_p(\mathcal{F})$, as a function of $p$. If $\mathcal{F}$ is closed under taking supersets, then this function is an increasing function of $p$. Seminal results of Friedgut and Friedgut-Kalai give criteria under which this function has a 'sharp threshold'. Perhaps surprisingly, a careful analysis of the behaviour of this function also yields some rather strong results in extremal combinatorics which do not explicitly mention the $p$-biased measure - in particular, in the field of Erdős-Ko-Rado type problems. We will discuss some of these, including a recent proof of an old conjecture of Frankl that a symmetric three-wise intersecting family of subsets of $\{1,2,\ldots,n\}$ has size $o(2^n)$, and some 'stability' results characterizing the structure of 'large' $t$-intersecting families of $k$-element subsets of $\{1,2,\ldots,n\}$. Based on joint work with (subsets of) Nathan Keller, Noam Lifschitz and Bhargav Narayanan.

I will begin the talk by reviewing the definition of commutative K-theory, a generalized cohomology theory introduced by Adem and Gomez. It is a refinement of topological K-theory, where the transition functions of a vector bundle satisfy a commutativity condition. The theory is represented by an infinite loop space which is called a “classifying space for commutativity”.  I will describe the homotopy type of this infinite loop space. Then I will discuss the graded ring structure on its homotopy groups, which corresponds to the tensor product of vector bundles.
 

(Joint work with Marco Golla and József Bodnár)
We will give a general overview of the plethora of concordance invariants which can be extracted from Ozsváth-Szabó-Rasmussen's knot Floer homology. 
We will then focus on the $\nu^+$ invariant and prove some of its useful properties. 
Furthermore we will show how it can be used to obstruct the existence of cobordisms between algebraic knots.

A cornerstone of the study of mapping class groups is the
Nielsen--Thurston classification theorem. I will outline a
polynomial-time algorithm that determines the Nielsen--Thurston type and
the canonical curve system of a mapping class. Time permitting, I shall
describe a polynomial-time algorithm to compute the quotient orbifold of
a periodic mapping class, and I shall discuss the conjugacy problem for
the mapping class group. This is joint work with Mark Bell.

Decorate knot cobordisms functorially induce maps on knot Floer homology.
We compute these maps for elementary cobordisms, and hence give a formula for 
the Alexander and Maslov grading shifts. We also show a non-vanishing result in the case of
concordances and present some applications to invertible concordances. 
This is joint work with Marco Marengon.
 

Configuration spaces of points in a manifold are well studied. Giving the points thickness has obvious physical meaning: the configuration space of non-overlapping particles is equivalent to the phase space, or energy landscape, of a hard spheres gas. But despite their intrinsic appeal, relatively little is known so far about the topology of such spaces. I will overview some recent work in this area, including a theorem with Yuliy Baryshnikov and Peter Bubenik that related the topology of these spaces to mechanically balanced, or jammed, configurations. I will also discuss work in progress with Robert MacPherson on hard disks in an infinite strip, where we understand the asymptotics of the Betti numbers as the number of disks tends to infinity. In the end, we see a kind of topological analogue of a liquid-gas phase transition.