Tag Archives: random graphs


I have just come to the end of the longest uninterrupted sequence of conferences I have ever had: five in a row, one of them a two-week conference. Since the start of July I have been at conferences in Egham, … Continue reading

Posted in exposition | Tagged , , , , , , | 2 Comments

Depth-first search

On Friday we had three lovely talks by Benny Sudakov and two of his students from UCLA, who are currently visiting Cambridge. The students both gave beautifully clear talks; Choongbum Lee wrote on the board, while we got Huang Hao’s … Continue reading

Posted in events, exposition | Tagged , | Leave a comment

Measuring triangle-free graphs

Anatoly Vershik is almost certainly the nearest thing to a universal mathematician that I know. The range of his interests is impossible to summarise: logic, algebra, combinatorics, analysis, probability, dynamical systems, mathematical physics, … I first met him in 2000, … Continue reading

Posted in events, exposition | Tagged , , , , | 2 Comments