On an infinite family of highly regular graphs

Datum

11.01.2019

Zeit

13:15 - 14:15

Sprecher

Maja Pech

Zugehörigkeit

U Novi Sad

Sprache

en

Hauptthema

Mathematik

Andere Themen

Mathematik

Host

Jun.-Prof. Dr. F. M. Schneider

Beschreibung

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.

Links

• Institut für Algebra: International Seminar

Letztmalig verändert: 07.01.2019, 14:37:29