On an infinite family of highly regular graphs

Date

Jan 11, 2019

Time

1:15 PM - 2:15 PM

Speaker

Maja Pech

Affiliation

U Novi Sad

Language

en

Main Topic

Mathematik

Other Topics

Mathematik

Host

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

Description

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

Last modified: Jan 7, 2019, 2:37:29 PM