Tata Institute of Fundamental Research
The Moore Bound for Irregular Graphs
STCS Student Seminar
Speaker:
Shanthanu Suresh Rai
Organiser:
Eeshan Modak
Date:
Friday, 3 Feb 2023, 16:00 to 17:00
Venue:
A201
(Scan to add to calendar)
Abstract:
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.
Paper: https://link.springer.com/article/10.1007/s003730200002
| Speaker: | Shanthanu Suresh Rai |
| Organiser: | Eeshan Modak |
| Date: | Friday, 3 Feb 2023, 16:00 to 17:00 |
| Venue: | A201 |
(Scan to add to calendar)
Abstract:
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.
Paper: https://link.springer.com/article/10.1007/s003730200002
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.
Paper: https://link.springer.com/article/10.1007/s003730200002