The Borel Combinatorics and Complexity research group has been established in 2022 at the Institute of Mathematics of the Eötvös University, supported by the Momentum Programme of the Hungarian Academy of Sciences. We are working on problems related to nice (definable) infinite graphs and their connections to large finite ones.


Balázs Bursics, MSc student
Máté Geng, MSc student
Tamás Kátay, PhD student
Anett Kocsis, BSc student
Gábor Kun, researcher
Máté Pálfy, PhD student
Zoltán Vidnyánszky, PI


We are organizing a weekly seminar on topics related to our group's resarch (currently, Monday 10:00). Contact us, if you are interested in attending.