Skip to main content
Log in

The Moore Bound for Irregular Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: June 27, 2000 Final version received: July 3, 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alon, N., Hoory, S. & Linial, N. The Moore Bound for Irregular Graphs. Graphs Comb 18, 53–57 (2002). https://doi.org/10.1007/s003730200002

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730200002

Keywords

Navigation