Skip to main navigation Skip to search Skip to main content

On Ramanujan bigraphs and general Ramanujan graphs

Research output: Contribution to journalReview articlepeer-review

Abstract

In this paper, we give an overview of new results that define and explicitly construct Ramanujan Cayley biregular bipartite graphs. We also study the extremal combinatorial properties of these graphs. This parallels the work of Lubotzky, Phillips and Sarnak on regular Ramanujan Cayley graphs, with several interesting differences. Furthermore, this work also proposes a stronger definition of Ramanujan graphs than has been used in the past, which opens the door to future studies.

Original languageEnglish
Pages (from-to)71-78
Number of pages8
JournalComptes Rendus Mathematique
Volume364
DOIs
StatePublished - 2026

Bibliographical note

Publisher Copyright:
© 2026, Academie des sciences. All rights reserved.

Keywords

  • Cayley bigraphs
  • Ramanujan conjecture
  • Ramanujan graphs
  • automorphic representations of U(3)
  • non-backtracking spectrum
  • pseudorandomness
  • simply-transitive lattices

Fingerprint

Dive into the research topics of 'On Ramanujan bigraphs and general Ramanujan graphs'. Together they form a unique fingerprint.

Cite this