The Moore bound for irregular graphs

Noga Alon; Shlomo Hoory; Nathan Linial

doi:10.1007/s003730200002

The Moore bound for irregular graphs

Noga Alon^*
, Shlomo Hoory
, Nathan Linial

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

140 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 language	English
Pages (from-to)	53-57
Number of pages	5
Journal	Graphs and Combinatorics
Volume	18
Issue number	1
DOIs	https://doi.org/10.1007/s003730200002
State	Published - 2002

Access to Document

10.1007/s003730200002

Cite this

@article{00c96d5d0f2541f0b2bdebee94d11207,

title = "The Moore bound for irregular graphs",

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

author = "Noga Alon and Shlomo Hoory and Nathan Linial",

year = "2002",

doi = "10.1007/s003730200002",

language = "אנגלית",

volume = "18",

pages = "53--57",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "1",

}

TY - JOUR

T1 - The Moore bound for irregular graphs

AU - Alon, Noga

AU - Hoory, Shlomo

AU - Linial, Nathan

PY - 2002

Y1 - 2002

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

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

UR - https://www.scopus.com/pages/publications/0036975468

U2 - 10.1007/s003730200002

DO - 10.1007/s003730200002

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0036975468

SN - 0911-0119

VL - 18

SP - 53

EP - 57

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 1

ER -

The Moore bound for irregular graphs

Abstract

Access to Document

Other files and links

Fingerprint

Cite this