Discrete mathematics seminar - Getting closer to a Moore graph

Speaker: Nacho López (Universitat de Lleida, Catalonia)

Abstract: Moore graphs are extremal graphs that appear in the context of the degree/diameter problem. The fact that Moore graphs are very rare suggest the study of graphs that are, in some sense, close to being a Moore graph. This closeness measure has been usually given by the difference between the Moore bound and the order of the corresponding founded graphs. Nevertheless, other approximations can be considered. In this talk we will present some background of the topic and we will discuss about these closeness measures.