The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
WEIL, A. A. (1967) · Springer eBooks · doi:10.1007/978-1-4612-9834-2 · Cited by 1,223
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
λ1, Isoperimetric inequalities for graphs, and superconcentrators
Alon, N., & Milman, V. D. (1985) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(85)90092-9 · Cited by 839
Automorphic forms on Adele groups
Gelbart, S. S. (1975) · Cited by 269
Strong Approximation for Semi-Simple Groups Over Function Fields
Prasad, G. (1977) · Annals of Mathematics · doi:10.2307/1970924 · Cited by 110
Cited by
Expander graphs and their applications
Hoory, S., Linial, N., & Wigderson, A. (2006) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-06-01126-8 · Cited by 1,723
Sipser, M., & Spielman, D. A. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556667 · Cited by 931
Undirected connectivity in log-space
Reingold, O. (2008) · Journal of the ACM · doi:10.1145/1391289.1391291 · Cited by 505
Linear degree extractors and the inapproximability of max clique and chromatic number
Zuckerman, D. (2006) · Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/1132516.1132612 · Cited by 398
Linear-time encodable and decodable error-correcting codes
Spielman, D. A. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556668 · Cited by 350
Metadata
- Authors
- Morgenstern, M.
- Venue
- Journal of Combinatorial Theory, Series B
- Publisher
- Elsevier BV
- Published
- 1994-09
- Volume
- 62
- Issue
- 1
- Pages
- 44-62
- ISSN
- 0095-8956 (ISSN-L)
- OpenAlex
- W2036871172
- Cited by
- 310
- References
- 5
- FWCI
- 8.64
- Type
- journal article
- Language
- en
- Open access
- bronze
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.