Automorphisms of graphs with a forbidden minor

Pascal Schweitzer (Darmstadt)

14-May-2021, 13:00-14:00 (3 years ago)

Abstract: According to Frucht’s classic theorem, every finite group is the automorphism group of a finite graph (up to isomorphism). We say the class of all graphs is universal. Babai proved in 1974 that graph classes with a forbidden minor, such as planar graphs, graphs of bounded genus, and graphs of bounded tree width, are not universal. He also made three conjectures regarding automorphisms of such graphs. I will describe a structure theorem of automorphism groups of such graphs, affirming these conjectures.

This is joint work with Martin Grohe and Daniel Wiebking.

combinatorics

Audience: researchers in the topic


Warwick Combinatorics Seminar

Series comments: This is the online combinatorics seminar at Warwick.

Organizers: Jan Grebik, Oleg Pikhurko
Curator: Hong Liu*
*contact for this listing

Export talk to