Seminar: Graphs, Groups, Topology and Computational Complexity; WS 2024/25
Prof. Dr. Radu Curticapean (FIDS)
/
Prof. Dr. Clara Löh
/
Matthias Uschold
News

The organisational meeting for this seminar:
Mo, 22.07., 12:00, via zoom:
zoom https link,
Meeting ID: 692 8229 1452 Passcode: 587001
Registration: through the GRIPS registration form (tba).

This seminar will be held in English. The written report
can be in English or German. The handouts should be in English.
Seminar: Graphs, Groups, Topology and Computational Complexity
This seminar for students of mathematics and computer science studies
the intersection of graph theory and computational complexity theory,
using techniques from group theory and topology to tackle problems
arising in this area. The seminar starts with introductory talks.
Then we focus on the following problems:

The graph isomorphism problem

Evasiveness conjecture
Several talks will also be suitable for students in the Lehramt Gymnasium track.
Time/Location
Wednesday, 8:00(?)10:00, M101
Material
Prerequisites
tba
This seminar is suitable for students
with an interest in graph theory, groups, topology, and algorithmic aspects; several talks
will also be suitable for students in the Lehramt
Gymnasium track.
This seminar could be the
starting point for a project under my supervision (e.g., bachelor thesis,
Zulassungsarbeit).
Formalities/Credits
See the commented list of courses.
Last Change: June 25, 2024.