Tag Archives: Benny Sudakov

BCC26, 2

The first lecture on Thursday was by Benny Sudakov, on robustness of graph properties. For purposes of exposition, he had decided to focus on one particular property, that of being Hamiltonian. Dirac’s famous theorem tells us that a graph on … Continue reading

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

London Combinatorics Colloquia 2016

The tenth London Combinatorics Colloquia took place over the last two days. (As was pointed out, this is not the same as the tenth anniversary!) A dozen really excellent talks, and I cannot do justice to them all, so I … Continue reading

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