Homepage of Jan Grebík

I am a postdoctoral researcher at Computer Science Institute of Charles University working with Vašek Rozhoň.

I am interested combinatorics, descriptive set theory, random processes and distributed computing.

Selected publications:

• Measurable Vizing's theorem, accepted to Forum Math. Sigma (2025), [arXiv, Journal].
• (with S. Brandt, Y. Chang, C. Grunau, V. Rozhoň, Z. Vidnyánszky) On Homomorphism Graphs, Forum Math. Pi 12 (2024), e10, [arXiv, Journal].
• (with V. Rozhoň) Local Problems on Grids from the Perspective of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics, Adv. Math. 431 (2023), [arXiv, Journal].
• (with R. Greenfeld, V. Rozhoň, T. Tao) Measurable tilings by abelian group actions, Int. Math. Res. Not 23 (2023), [arXiv, Journal].
• (with O. Pikhurko) Measurable versions of Vizing's theorem, Adv. Math. 374 (2020), [arXiv, Journal].

I have recieved the 2022 Mary Ellen Rudin Young Researcher Award.

I have recieved the Early Career Award 2025 of the European Set Theory Society.

Our research on distributed algorithms and measurable combinatorics has been highlighted by Quanta Magazine.
See also our survey with Z. Vidnyánszky From descriptive to distributed, or the great surveys of Bernshteyn, Pikhurko, and Kechris and Marks on recent development in the area.

Publications, also available on arXiv
Google scholar
MathSciNet
ORCID: orcid.org/0000-0002-9980-4660
Here is my short [CV]

Recent events that I co-organize

• Young Set Theory Workshop, June 17-21, 2024,
• Workshop on Measurable Combinatorics, June 24-28, 2024.

Teaching