The celebrated strong cosmic censorship conjecture in general relativity in particular suggests that the Cauchy horizon in the interior of the Kerr black hole is unstable and small perturbations would give rise to singularities. We present a recent result proving that the Cauchy horizon is stable in the sense that spacetime arising from data close to that of Kerr has a continuous metric up to the Cauchy horizon. We discuss its implications on the nature of the potential singularity in the interior of the black hole. This is joint work with Mihalis Dafermos.

In this talk I will present several results connected with the idea of magnetic relaxation for MHD, including some new commutator estimates (and a counterexample to the estimate in the critical case). (Joint work with various subsets of  D. McCormick, J. Robinson, C. Fefferman and J-Y. Chemin.)

We consider the two-phase Stefan problem with p-degenerate diffusion, p larger than two, and we prove continuity up to the boundary for weak solutions, providing a modulus of continuity which we conjecture to be optimal. Since our results are proven in the form of a priori estimates for appropriate regularized problems, as corollary we infer the existence of a globally continuous weak solution for continuous Cauchy-Dirichlet datum.

      I will show uniqueness result for BV solutions of scalar conservation laws with discontinuous flux in several space dimensions. The proof is based on the notion of kinetic solution and on a careful analysis of the entropy dissipation along the discontinuities of the flux.
 

Gyárfás conjectured in 1985 that if $G$ is a graph with no induced cycle of odd length at least 5, then the chromatic number of $G$ is bounded by a function of its clique number.  We prove this conjecture.  Joint work with Paul Seymour.

More than twenty years ago Erdős conjectured that a triangle-free graph $G$ of chromatic number $k$ contains cycles of at least $k^{2−o(1)}$ different lengths. In this talk we prove this conjecture in a stronger form, showing that every such $G$ contains cycles of $ck^2\log k$ consecutive lengths, which is tight. Our approach can be also used to give new bounds on the number of different cycle lengths for other monotone classes of $k$-chromatic graphs, i.e.,  clique-free graphs and graphs without odd cycles.

Joint work with A. Kostochka and J. Verstraete.

We study the properties of finite graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to some fixed graph $F$. (Such a graph is said to be $r$-locally-$F$.) This is a natural extension of the study of regular graphs, and of the study of graphs of constant link. We focus on the case where $F$ is $\mathbb{L}^d$, the $d$-dimensional integer lattice. We obtain a characterisation of all the finite graphs in which the ball of radius $3$ around each vertex is isomorphic to the ball of radius $3$ in $\mathbb{L}^d$, for each integer $d$. These graphs have a very rigidly proscribed global structure, much more so than that of $(2d)$-regular graphs. (They can be viewed as quotient lattices in certain 'flat orbifolds'.) Our results are best possible in the sense that '3' cannot be replaced with '2'. Our proofs use a mixture of techniques and results from combinatorics, algebraic topology and group theory. We will also discuss some results and open problems on the properties of a random n-vertex graph which is $r$-locally-$F$. This is all joint work with Itai Benjamini (Weizmann Institute of Science).