Approximate Moore Graphs are good expanders

Michael Dinitz, Michael Schapira, Gal Shahaf

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse direction, showing that “sufficiently large” graphs of fixed diameter and degree must be “good” expanders. We prove this statement for various definitions of “sufficiently large” (multiplicative/additive factor from the largest possible size), for different forms of expansion (edge, vertex, and spectral expansion), and for both directed and undirected graphs. A recurring theme is that the lower the diameter of the graph and (more importantly) the larger its size, the better the expansion guarantees. Aside from inherent theoretical interest, our motivation stems from the domain of network design. Both low-diameter networks and expanders are prominent approaches to designing high-performance networks in parallel computing, HPC, datacenter networking, and beyond. Our results establish that these two approaches are, in fact, inextricably intertwined. We leave the reader with many intriguing questions for future research.

Original languageAmerican English
Pages (from-to)240-263
Number of pages24
JournalJournal of Combinatorial Theory. Series B
StatePublished - Mar 2020

Bibliographical note

Publisher Copyright:
© 2019 Elsevier Inc.


  • Expander graphs
  • Network design
  • Spectral graph theory


Dive into the research topics of 'Approximate Moore Graphs are good expanders'. Together they form a unique fingerprint.

Cite this