On Ramanujan bigraphs and general Ramanujan graphs
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.
Authors
- Brooke Feigon (ORCID: https://orcid.org/0009-0001-1798-8372)
- Kathrin Maurischat (ORCID: https://orcid.org/0000-0002-6665-1522)
- Shai Evra
- Ori Parzanchevski (ORCID: https://orcid.org/0000-0003-1596-215X)
Institutions
- City College of New York (US)
- Hebrew University of Jerusalem (IL)
- RWTH Aachen University (DE)
Publication Details
- Journal
- Comptes Rendus Mathématique
- Published
- 2026-01-22
- DOI
- https://doi.org/10.5802/crmath.819
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00