The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Pseudo-random Graphs
Open accessAbstract
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in proving an enormous number of combinatorial statements, making their role quite hard to overestimate. Their tremendous success serves as a natural motivation for the following very general and deep informal questions: what are the essential properties of random graphs? How can one tell when a given graph behaves like a random graph? How to create deterministically graphs that look random-like? This leads us to a concept of pseudo-random graphs.
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
(1979) · Cited by 43,841
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
Lide, R., & Niederreiter, H. (1996) · Cited by 2,213
Łuczak, T., Janson, S., & Ruciński, A. (2000) · Cited by 2,192
Brouwer, A. E., & Haemers, W. H. (2011) · Universitext · doi:10.1007/978-1-4614-1939-6_12 · Cited by 1,987
Davenport, H. (1980) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-5927-3 · Cited by 1,893
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
(1986) · Journal of the Operational Research Society · doi:10.1057/jors.1986.93 · Cited by 1,679
Janson, S., Łuczak, T., & Rucinski, A. (2000) · Wiley eBooks · doi:10.1002/9781118032718 · Cited by 1,545
Metadata
- Authors
- Krivelevich, M., & Sudakov, B.
- Venue
- Bolyai Society Mathematical Studies
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 199-262
- ISSN
- 1217-4696 (ISSN-L)
- OpenAlex
- W1639593279
- Cited by
- 285
- References
- 33
- FWCI
- 61.38
- Type
- book chapter
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Pseudo-random Graphs. https://app.cochat.ai/papers/10.1007/978-3-540-32439-3_10
- The paper
- Krivelevich, M., & Sudakov, B. (2006). Pseudo-random Graphs. Bolyai Society Mathematical Studies. https://doi.org/10.1007/978-3-540-32439-3_10
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.