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

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

The Probability That a Random Multigraph is Simple

Open access
JANSON, SVANTE · 2009 · Combinatorics, Probability and Computing

Abstract

Consider a random multigraph G* with given vertex degrees d1,. . .,dn, constructed by the configuration model. We show that, asymptotically for a sequence of such multigraphs with the number of edges $\tfrac12\sumd\to\infty$, the probability that the multigraph is simple stays away from 0 if and only if $\sumdd=O\bigpar{\sumd}$. This was previously known only under extra assumptions on the maximum degree maxidi. We also give an asymptotic formula for this probability, extending previous results by several authors.

Overview

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.

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

Integrity signals

Registry

Crossref · 10.1017/s0963548308009644

Cites

1 of 1 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.

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.

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 1 references

Cited by

See all 178

Metadata

Authors
JANSON, S.
Venue
Combinatorics, Probability and Computing
Published
2009-03
Volume
18
Issue
1-2
Pages
205-225
ISSN
  • 0963-5483 (ISSN-L)
  • 1469-2163
OpenAlex
W2148896022
Cited by
178
References
1
FWCI
17.07
Type
journal article
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: The Probability That a Random Multigraph is Simple. https://app.cochat.ai/papers/10.1017/s0963548308009644
The paper
JANSON, S. (2009). The Probability That a Random Multigraph is Simple. Combinatorics, Probability and Computing. https://doi.org/10.1017/s0963548308009644

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.