Algomanet – spring 2026

Basic information

The two Algomanet courses scheduled for the spring 2025 will take place in Leipzig. The event is organized jointly by Leipzig University and MPI for Mathematics in the Sciences. The courses will take place in the Leibniz-Saal (E1 05) of the MPI MiS (Inselstr. 22), starting at 9am on Tuesday June 30 and concluding in late afternoon on Friday July 3.

The registration is now open. You can register by sending an e-mail to Jean-Marc Mues (jean-marc.mues@uni-leipzig.de) before the deadlines noted below. It is possible to register for both or just one of the two courses offered. We have some amount of funding available to support accommodation in Leipzig; if the absence of additional financial support can prevent you from participating, please discuss with us possible options. The courses are primarily intended for those affiliated with the participating universities, however, we will be able to offer a limited number of places to students not affiliated with either of the six universities in the network.

Matija Bucić: Sublinear expander graphs

Abstract: Expander graphs are one of the most widely useful classes of graphs ever considered. In this course, we will explore a (weaker) notion of sublinear expansion due to Komlós and Szemerédi from the early 90's which has found a remarkable number of impressive applications in recent years. We will start with a brief introduction to the theory of expander graphs, introduce the sublinear notion, show the pass to expander and expander decomposition lemmas, establish a number of properties, and illustrate how they were used in some of the aforementioned recent applications.

Jinyoung Park: Asymptotic enumeration via graph containers and entropy

Abstract: The container methods are powerful tools to bound the number of independent sets of graphs and hypergraphs, and they have been extremely influential in the area of extremal and probabilistic combinatorics. We will focus on more specialized graph container methods due to Sapozhenko (1987) that deal with sets in expander graphs. Entropy, first introduced by Shannon (1948) in the area of information theory, is a measure of the expected amount of information contained in a random variable. Entropy has seen lots of fascinating applications in a wide range of enumeration problems. In this series of lectures, we will discuss some old and new applications of graph containers, entropy methods, and their combinations for various enumeration problems.