The Moore bound for irregular graphs

Noga Alon*, Shlomo Hoory, Nathan Linial

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

125 Scopus citations

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 is extended here to cover irregular graphs as well, yielding an affirmative answer to an old open problem ([4] p. 163, problem 10).

Original languageAmerican English
Pages (from-to)53-57
Number of pages5
JournalGraphs and Combinatorics
Volume18
Issue number1
DOIs
StatePublished - 2002

Fingerprint

Dive into the research topics of 'The Moore bound for irregular graphs'. Together they form a unique fingerprint.

Cite this