Combinatorics, Probability and Computing
Michael Krivelevich
Tel Aviv University, IsraelOliver M. Riordan
Oxford University, UKAngelika Steger
ETH Zentrum, Zürich, Switzerland
Abstract
The main theme of this workshop was the use of probabilistic methods in combinatorics and theoretical computer science. Although these methods have been around for decades, they are being refined all the time: they are getting more and more sophisticated and powerful. Another theme was the study of random combinatorial structures, either for their own sake, or to tackle extremal questions. The workshop also emphasized connections between probabilistic combinatorics and discrete probability.
Cite this article
Michael Krivelevich, Oliver M. Riordan, Angelika Steger, Combinatorics, Probability and Computing. Oberwolfach Rep. 16 (2019), no. 2, pp. 1113–1189
DOI 10.4171/OWR/2019/19