Ma

On an infinite family of highly regular graphs

Datum
11.01.2019 
Zeit
13:15 Uhr - 14:15 Uhr 
Sprecher
Maja Pech  
Institut
U Novi Sad 
Sprache
en 
Hauptthema
Mathematik: Allgemein
Ansprechpartner
Jun.-Prof. Dr. F. M. Schneider  
Zusammenfassung

Highly regular graphs for which not all regularities are explainable by symmetries are fascinating creatures. Some of them like, e.g., the line graph of W. Kantor's non-classical GQ(25,5), are stumbling stones for existing implementations of graph isomorphism tests.They appear to be extremely rare and even once constructed it is difficult to prove their high regularity.Yet some of them, like the McLaughlin graph on 275 vertices and Ivanov's graph on 256 vertices are of profound beauty. This alone makes it an attractive goal to strive for their complete classification or, failing this, at least to get a deep understanding of them.Recently, Ch. Pech discovered new methods for proving high regularity of graphs. Using these techniques, in this talk we report on a family of strongly regular graphs, originally discovered by A.V. Ivanov in 1990. We show that they are (3,5)-regular.

 

Letzte Aktualisierung: 07.01.2019 13:37.

Vortragsort 

TUD Willers-Bau (WIL C 133) 
Zellescher Weg 12-14
01069 Dresden
Homepage
https://navigator.tu-dresden.de/etplan/wil/00 

Veranstalter 

TUD Mathematik
Willersbau, Zellescher Weg 12-14
01069 Dresden
Telefon
49-351-463 33376 
Homepage
http://tu-dresden.de/mathematik 
Scannen Sie diesen Code mit ihrem Smartphone und erhalten Sie diese Veranstaltung direkt in ihren Kalender. Vergrößern Sie das Bild durch Klicken auf den QR-Code, sollten Sie Probleme beim Scannen haben.