• Peter Keevash

    University of Oxford, UK
  • Wojciech Samotij

    Tel Aviv University, Israel
  • Benjamin Sudakov

    ETH Zürich, Switzerland
Combinatorics cover
Download PDF

A subscription is required to access this article.


Combinatorics is an area of mathematics primarily concerned with counting and studying properties of discrete objects such as graphs, set systems, partial orders, polyhedra, etc. Combinatorial problems naturally arise in many areas of mathematics, such as algebra, geometry, probability theory, and topology, and in theoretical computer science. Historically, such questions were often studied using ad hoc arguments. However, over the last few decades, the development of general and powerful methods have elevated combinatorics to a thriving branch of mathematics with many connections to other subjects. The workshop brought together the established leading experts and the brightest young talents from different parts of this very broad area in order to discuss the most exciting recent developments, current themes and trends, and the most promising new directions for future research.

Cite this article

Peter Keevash, Wojciech Samotij, Benjamin Sudakov, Combinatorics. Oberwolfach Rep. 20 (2023), no. 1, pp. 5–89

DOI 10.4171/OWR/2023/1