L3

We consider random walks on two classes of random graphs and explore the likely structure of the the set of unvisited vertices or vacant set. In both cases, the size of the vacant set $N(t)$ can be obtained explicitly as a function of $t$. Let $\Gamma(t)$ be the subgraph induced by the vacant set. We show that, for random graphs $G_{n,p}$ above the connectivity threshold, and for random regular graphs $G_r$, for constant $r\geq 3$, there is a phase transition in the sense of the well-known Erdos-Renyi phase transition. Thus for $t\leq (1-\epsilon)t^*$ we have a unique giant plus components of  size $O(\log n)$ and for $t\geq (1+\epsilon)t^*$ we have only components of  size $O(\log n)$.

In the case of $G_r$ we describe the likely degree sequence, size of the giant component and structure of the small ($O(\log n)$) size components.

A random planar graph $P_n$ is a graph drawn uniformly at random from the class of all (labelled) planar graphs on $n$ vertices. In this talk we show that with probability $1-o(1)$ the number of vertices of degree $k$ in $P_n$ is very close to a quantity $d_k n$ that we determine explicitly. Here $k=k(n) \le c \log n$. In the talk our main emphasis will be on the techniques for proving such results. (Joint work with Kosta Panagiotou.)

We highlight a technique for studying edge colourings of multigraphs, due to Tashkinov. This method is a sophisticated generalisation of the method of alternating paths, and builds upon earlier work by Kierstead and Goldberg. In particular we show how to apply it to a number of edge colouring problems, including the question of whether the class of multigraphs that attain equality in Vizing's classical bound can be characterised.

This talk represents joint work with Jessica McDonald.

In 1961 Hajos conjectured that if a graph contains no subdivsion of a clique of order t then its chromatic number is less than t. In 1981, Erdos and Fajtlowicz showed that the conjecture is almost always false. We show it is almost always true. This is joint work with Keevash, Mohar, and McDiarmid.

In joint work with Tim Perutz, we give a complete characterization of the Fukaya category of the punctured torus, denoted by $Fuk(T_0)$. This, in particular, means that one can write down an explicit minimal model for $Fuk(T_0)$ in the form of an A-infinity algebra, denoted by A, and classify A-infinity structures on the relevant algebra. A result that we will discuss is that no associative algebra is quasi-equivalent to the model A of the Fukaya category of the punctured torus, i.e., A is non-formal. $Fuk(T_0)$ will be connected to many topics of interest: 1) It is the boundary category that we associate to a 3-manifold with torus boundary in our extension of Heegaard Floer theory to manifolds with boundary, 2) It is quasi-equivalent to the category of perfect complexes on an irreducible rational curve with a double point, an instance of homological mirror symmetry.

I will discuss a conjectural Bogomolov-Gieseker type inequality for "tilt-stable" objects in the derived category of coherent sheaves on smooth projective threefolds. The conjecture implies the existence of Bridgeland stability conditions on threefolds, and also has implications to birational geometry: it implies a slightly weaker version of Fujita's conjecture on very ampleness of adjoint line bundles.

Counting the number of curves of degree $d$ with $n$ nodes (and no further singularities) going through $(d^2+3d)/2 - n$ points in general position in the projective plane is a problem which was already considered more than 150 years ago. More recently, people conjectured that for sufficiently large $d$ this number should be given by a polynomial of degree $2n$ in $d$. More generally, the Göttsche conjecture states that the number of $n$-nodal curves in a general $n$-dimensional linear subsystem of a sufficiently ample line bundle $L$ on a nonsingular projective surface $S$ is given by a universal polynomial of degree $n$ in the 4 topological numbers $L^2, L.K_S, (K_S)^2$ and $c_2(S)$. In a joint work with Vivek Shende and Richard Thomas, we give a short (compared to existing) proof of this conjecture.

If two L-functions are added together, the Euler product is destroyed.

Thus the linear combination is not an L-function, and hence we should

not expect a Riemann Hypothesis for it. This is indeed the case: Not

all the zeros of linear combinations of L-functions lie on the

critical line.

However, if the two L-functions have the same functional equation then

almost all the zeros do lie on the critical line. This is not seen

when they have different functional equations.

We will discuss these results (which are due to Bombieri and Hejhal)

during the talk, and demonstrate them using characteristic polynomials

of random unitary matrices, where similar phenomena are observed. If

the two matrices have the same determinant, almost all the zeros of

linear combinations of characteristic polynomials lie on the unit

circle, whereas if they have different determinants all the zeros lie

off the unit circle.