Oberwolfach Reports

Full-Text PDF (649 KB) | Introduction as PDF | Metadata | Table of Contents | OWR summary
Volume 13, Issue 2, 2016, pp. 1189–1257
DOI: 10.4171/OWR/2016/22

Published online: 2017-02-07

Combinatorics and Probability

Béla Bollobás[1], Michael Krivelevich[2], Oliver M. Riordan[3] and Emo Welzl[4]

(1) Cambridge University, UK
(2) Tel Aviv University, Israel
(3) Oxford University, UK
(4) ETH Zürich, Switzerland

For the past few decades, Combinatorics and Probability Theory have had a fruitful symbiosis, each benefitting from and influencing developments in the other. Thus to prove the existence of designs, probabilistic methods are used, algorithms to factorize integers need combinatorics and probability theory (in addition to number theory), and the study of random matrices needs combinatorics. In the workshop a great variety of topics exemplifying this interaction were considered, including problems concerning designs, Cayley graphs, additive number theory, multiplicative number theory, noise sensitivity, random graphs, extremal graphs and random matrices.

No keywords available for this article.

Bollobás Béla, Krivelevich Michael, Riordan Oliver, Welzl Emo: Combinatorics and Probability. Oberwolfach Rep. 13 (2016), 1189-1257. doi: 10.4171/OWR/2016/22