Resumen de On local bipartite Moore graphs

Nacho López, Josep Conde, Gabriela Araujo-Pardo

• Given the values of the maximum degree d and the (even) girth g of a bipartite graph,there is a natural lower bound for its number of vertices known as the bipartite Moore bound.Graphs attaining such a bound are referred to as bipartite Moore graphs. The fact that thereare very few bipartite Moore graphs suggests the definition of local bipartite Moore graphs.Here we consider the problem of classifying these graphs according to their ‘proximity’ tosome properties that a theoretical bipartite Moore graph should have.