GGC 26

This is an informal one-day workshop to explore common themes and potential future collaboration around group theory, graph theory and combinatorics. Recent years have seen a number of exciting developments at the intersection of these fields, and we hope to bring together researchers from different backgrounds to discuss these developments and their potential applications.

• Vadim Alekseev — TU Dresden
• Manuel Bodirsky — TU Dresden
• Johannes Carmesin — TU BA Freiberg
• Łukasz Grabowski — Universität Leipzig
• Daniel Neuen — TU Dresden
• Dan Král — Universität Leipzig / MPI MIS Leipzig
• Martin Schneider — TU BA Freiberg
• Andreas Thom — TU Dresden

Talks are 30 minutes, with 20-minute breaks between talks. All times and assignments are tentative.

• 09:10–09:40
  Dan Král: "Combinatorial limits and their use in extremal combinatorics and quasirandomness"
• 10:00–10:30
  Manuel Bodirsky: "A uniform polynomial-time algorithm for CSPs of finite groups" / "Asymptotic theories of random directed graphs with forbidden subgraphs"
• 10:50–11:20
  Daniel Neuen: "Graph indistinguishability and similarity"
• 11:40–12:10
  Johannes Carmesin: "Connectivity methods, and related conjectures in Cayley graphs"
• 12:10–13:40 — Lunch break
• 13:40–14:10
  Andreas Thom: "Sofic groups and applications"
• 14:30–15:00
  Vadim Alekseev: tba
• 15:20–15:50
  Łukasz Grabowski: "Variants of the Kun-Toth result on controlling the Borel sigma-algebra of a Borel graph".
• 16:10–16:40
  Martin Schneider: tba
• 16:40–18:00 — Discussion
• 18:00 — end of the meeting
  transition to joint dinner

TU Dresden (Willersbau) — room TBC
Zellescher Weg 12–14, 01069 Dresden
Campus Navigator