About
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.
People
Balázs Bursics, PhD student, 2022-
Garrett Ervin, Momentum MSCA postdoc, 2026-
Máté Geng, PhD student, 2022-
Tamás Kátay, PhD student, 2022-24
Anett Kocsis, MSc student, 2022-
Gábor Kun, researcher, 2022-
Clark Lyons, postdoc (joint with G. Tardos), 2024-
Máté Pálfy, PhD student, 2022-24
Zoltán Vidnyánszky, PI
Publications and theses
11. C. Lyons, G. Terlov, ZV: A note on the ineffectiveness of the regularity lemma for bounded degree graphs, preprint.
10. G. Kun, J. Nesetril: Dichotomy for orderings?
9. B. Bursics, ZV: Hyperfiniteness on Topological Ramsey Spaces, preprint.
8. J. Grebik, ZV: Complexity of linear equations and infinite gadgets, preprint.
7. J. Grebik, ZV: From Descriptive to Distributed, submitted.
6. J. Frisch, F. Shinko, ZV: Hyper-hyperfiniteness and complexity, preprint.
5. E. Csoka, ZV: FIID homomorphisms and entropy inequalities, submitted.
4. P. T. Fekete, G. Kun: Easy testability for posets, Eur. J. Comb., to appear.
3. M. Bowen, G. Kun, M. Sabok: The uniform Gardner conjecture and rounding
Borel flows, Proc. Amer. Math. Soc., to appear.
2. T. Katay, L. M. Toth, ZV:
The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms, submitted.
1. G. Kun: The measurable Hall theorem fails for treeings, submitted.
B. Bursics: Borel equivalence relations and Ramsey theory, (MSc thesis).
L. Szepessy: Betekintés a Borel-kombinatorikába, (MSc thesis, in Hungarian).
Seminar
We are organizing a weekly seminar on topics related to our group's resarch (Wednesday 14:00).