What is the largest number of edges in a graph of order n and girth g? For d-regular graphs, essentially the best known answer is provided by the Moore bound. This result can be extended to cover irregular graphs as well.
In the talk, we will look at what the Moore bound is and some problems related to Moore graphs. Then we will try to generalize the Moore bound for irregular graphs.