Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 415

The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.

The evolution of random graphs

Bollobás, Béla·1984·Transactions of the American Mathematical Society

Abstract

According to a fundamental result of Erdös and Rényi, the structure of a random graph GM changes suddenly when M∼n/2: if M=⌊cn⌋and c>12 then a.e. random graph of order n and since M is such that its largest component has O(log⁡n)vertices, but for c>12 a.e.GM has a giant component: a component of order(1−αc+o(1))n where αc>1. The aim of this paper is to examine in detail the structure of a random graph GM when M is close to n/2. Among others it is proved that if M=n/2+s,s=o(n)and s≥(log⁡n)1/2n2/3 then the giant component has(4+o(1))s vertices. Furthermore, rather precise estimates are given for the order of the r th largest component for every fixed r.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1090/s0002-9947-1984-0756039-5

Cites

7 of 7 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 7 references

Cited by

See all 415

Metadata

Authors
Bollobás, B.
Venue
Transactions of the American Mathematical Society
Published
1984
Volume
286
Issue
1
Pages
257-274
ISSN
  • 0002-9947 (ISSN-L)
  • 1088-6850
OpenAlex
W1983610133
Cited by
415
References
7
FWCI
0.78
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: The evolution of random graphs. https://app.cochat.ai/papers/10.1090/s0002-9947-1984-0756039-5
The paper
Bollobás, B. (1984). The evolution of random graphs. Transactions of the American Mathematical Society. https://doi.org/10.1090/s0002-9947-1984-0756039-5

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.