The chromatic number of Kneser graphs and some q-analogues

Lecturer: Tim Mussche

A number of classical problems in Extremal Set Theory have natural analogues in Finite Geometry. An example is determining the chromatic number of the q-Kneser graphs and other q-analogues of the Kneser graphs. In this talk we will present the background and current state of this problem.

back to EIDMA Seminar Combinatorial Theory announcements