Campus Event Calendar
Event Entry
New for: D1, D2, D3, D4, D5
What and Who
Graph Problems Arising from Group Theoretic
Pascal Schweitzer
Max-Planck-Institut für Informatik - D 1
Ringvorlesung
AG 1, AG 2, AG 3, AG 4, AG 5, SWS
Public Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 2 November 2006
13:00
60 Minutes
E1 3 - Hörsaal Gebäude
016
Saarbrücken
Abstract
Past work has shown a rich connection between the areas of combinatorial group theory and graph theory. For example graphs serve as group invariants, groups serve as graph invariants, by determining the automorphism group of a graph one can solve the isomorphism problem, every finite group is the automorphism group of some graph, and the list continues...
As example for these two directions I will review the Cayley-graph and define the Fundamental group of a graph. The Nielsen-Schreier Theorem shows that the fundamental group of a Graphs is free. Free groups continue to receive a lot of attention among group-theorists.
Warren Dicks showed in 1994 the equivalence of the strengthened Hanna
Neumann conjecture and the almalgamated graph conjecture. I will briefly describe the group theoretic side of this, and then in more detail explain the graph theoretic side.
Contact
--email hidden
passcode not visible
logged in users only
Brigitta Hansen, 11/02/2006 10:19
Pascal Schweitzer, 11/01/2006 15:28
Veronika Weinand, 10/24/2006 12:47
Veronika Weinand, 10/23/2006 15:06
Veronika Weinand, 10/19/2006 14:54
Veronika Weinand, 10/16/2006 17:07
Veronika Weinand, 10/16/2006 17:05 -- Created document.
Pascal Schweitzer, 11/01/2006 15:28
Veronika Weinand, 10/24/2006 12:47
Veronika Weinand, 10/23/2006 15:06
Veronika Weinand, 10/19/2006 14:54
Veronika Weinand, 10/16/2006 17:07
Veronika Weinand, 10/16/2006 17:05 -- Created document.