Oberwolfach Reports

Full-Text PDF (621 KB) | Introduction as PDF | Metadata | Table of Contents | OWR summary
Volume 3, Issue 4, 2006, pp. 2875–2952free sample!
DOI: 10.4171/OWR/2006/48

Published online: 2007-09-30

Combinatorics, Probability and Computing

Noga Alon[1], Béla Bollobás[2] and Ingo Wegener[3]

(1) Sackler Faculty of Exact Sciences, Tel Aviv, Israel
(2) University of Cambridge, UK
(3) Universität Dortmund, Germany

The conference was organized by Noga Alon (Tel Aviv), B\'ela Bollob\'as (Cambridge and Memphis) and Ingo Wegener (Dortmund). The programme consisted of 8 main lectures, supplemented by 21 shorter contributions, and covered many areas in Extremal and Probabilistic Combinatorics as well as in Theoretical Computer Science.

In its simplest form, the Probabilistic Method refers to the technique of proving the existence of structures with unexpected properties by showing that a randomly chosen object from an appropriate probability distribution has the properties with positive probability. The probabilistic method has been strikingly successful in Combinatorics, Graph Theory and Combinatorial Number Theory, and the probabilistic point of view has had an enormous influence on theoretical computer science.

The speakers reported on recent developments in Ramsey theory, including variants of these problems for Random Graphs and for Geometric questions, extending classical work in Functional Analysis. Extremal graph and hypergraph theory has also been discussed extensively, combining combinatorial, probabilistic and analytic tools. Additional active topics discussed included Percolation on quasi-random graphs and the properties of random triangulations of point sets in the plane as well as novel results in Complexity Theory including connections between communication complexity and geometric problems, and the study of refutation proofs for random instances of satisfiability.

The aim of the workshop was to focus on the connections and common themes of Combinatorics, Discrete Probability and Theoretical Computer Science. The diversity of the topics and participants stimulated a lot of fruitful discussions between researchers in different and yet related branches and gave rise to interesting discussions and new collaborations between the participants including the younger generation of researchers.

49 scientists, including 36 from countries other than Germany participated in the meeting. The organizers and participants would like to thank the Mathematisches Forschungsinstitut Oberwolfach for providing an inspiring setting for this conference.

No keywords available for this article.

Alon Noga, Bollobás Béla, Wegener Ingo: Combinatorics, Probability and Computing. Oberwolfach Rep. 3 (2006), 2875-2952. doi: 10.4171/OWR/2006/48