The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Ramanujan graphs
Abstract
A large family of explicitk-regular Cayley graphsX is presented. These graphs satisfy a number of extremal combinatorial properties.(i)For eigenvaluesλ ofX eitherλ=±k or ¦λ¦≦2 √k−1. This property is optimal and leads to the best known explicit expander graphs.(ii)The girth ofX is asymptotically ≧4/3 logk−1 ¦X¦ which gives larger girth than was previously known by explicit or non-explicit constructions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
Modular forms and Dirichlet series
Ogg, A. P. (1969) · W.A. Benjamin eBooks · Cited by 253
Hecke operators and distributing points on the sphere I
Lubotzky, A., Phillips, R., & Sarnak, P. (1986) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160390710 · Cited by 184
Self-citationQuaternäre quadratische Formen und die Riemannsche Vermutung fÜr die Kongruenzzetafunktion
Eichler, M. (1954) · Archiv der Mathematik · doi:10.1007/bf01898377 · Cited by 128
Girths of bipartite sextet graphs
Weiss, A. (1984) · COMBINATORICA · doi:10.1007/bf02579225 · Cited by 41
Cited by
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522
Sipser, M., & Spielman, D. A. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556667 · Cited by 931
Simulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Quantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
Metadata
- Authors
- Lubotzky, A., Phillips, R., & Sarnak, P.
- Venue
- Combinatorica
- Published
- 1988-09
- Volume
- 8
- Issue
- 3
- Pages
- 261-277
- ISSN
- 0209-9683 (ISSN-L)
- 1439-6912
- OpenAlex
- W4235946010
- Cited by
- 1,011
- References
- 5
- FWCI
- 19.95
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.