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 - http://www.scopus.com/inward/record.url?scp=0036975468&partnerID=8YFLogxK
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 -