Introduction:

Our founding mentor is Gyula O.H. Katona.

The Department of Extremal Combinatorics was established at the beginning of 2021, when the long-existing and large Department of Discrete Mathematics was divided into three units of roughly the same size as the non-combinatorial departments. The main research profile of our department is the study of extremal problems concerning finite hypergraphs, partially ordered sets, vector spaces over finite fields, and graphs—that is, determining the maximum or minimum size of structures satisfying certain conditions. Our highlighted topics include Turán-type theorems, Sperner-type problems, and their generalizations.

Together with the Departments of Graph Theory and Combinatorics and Its Applications, we continue to organize the institute’s combinatorics seminars:

  • Combinatorics Seminar
  • Extremal Set Systems Seminar
  • Combinatorial Search Theory Seminar.

Head of Department:

Employees:

External staff:

Events:

Previous:
Erdős Center
All
Next:
Geometry