The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Graph Theory and Probability
Abstract
A well-known theorem of Ramsay (8; 9) states that to every n there exists a smallest integer g(n) so that every graph of g(n) vertices contains either a set of n independent points or a complete graph of order n , but there exists a graph of g(n) – 1 vertices which does not contain a complete subgraph of n vertices and also does not contain a set of n independent points. (A graph is called complete if every two of its vertices are connected by an edge; a set of points is called independent if no two of its points are connected by an edge.) These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Some remarks on the theory of graphs
Erdös, P. (1947) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1947-08785-1 · Cited by 645
Self-citation
Cited by
Feder, T., & Vardi, M. Y. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539794266766 · Cited by 1,030
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
Aggregation of Inequalities in Integer Programming
Chvátal, V., & Hammer, P. L. (1977) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70731-3 · Cited by 448
Local Operator Theory, Random Matrices and Banach Spaces
(2001) · Handbook of the Geometry of Banach Spaces · doi:10.1016/s1874-5849(01)80010-3 · Cited by 432
Metadata
- Authors
- Erdös, P.
- Venue
- Classic Papers in Combinatorics
- Publisher
- Birkhäuser Boston
- Published
- 2009
- Pages
- 276-280
- OpenAlex
- W2161439427
- Cited by
- 611
- References
- 1
- FWCI
- 39.05
- Type
- book chapter
- 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: Graph Theory and Probability. https://app.cochat.ai/papers/10.1007/978-0-8176-4842-8_19
- The paper
- Erdös, P. (2009). Graph Theory and Probability. Classic Papers in Combinatorics. https://doi.org/10.1007/978-0-8176-4842-8_19
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.