Groups, Graphs and Combinatorics Series — TU Dresden
June 19, 2026, at TU Dresden
Time: 9:10–18:00
Location: TU Dresden (Willersbau), room TBC
- Talks tba
April 20, 2026, at TU Dresden
- Dan Král: "Combinatorial limits and their use in extremal combinatorics and quasirandomness"
- Manuel Bodirsky: "A uniform polynomial-time algorithm for CSPs of finite groups" / "Asymptotic theories of random directed graphs with forbidden subgraphs"
- Daniel Neuen: "Graph indistinguishability and similarity"
- Johannes Carmesin: "Connectivity methods, and related conjectures in Cayley graphs"
- Andreas Thom: "Sofic groups and applications"
- Vadim Alekseev: "Coarse geometry of groups and their approximations"
- Łukasz Grabowski: "Variants of the Kun-Toth result on controlling the Borel sigma-algebra of a Borel graph"
- Martin Schneider: "Dynamical properties of automorphism groups"