The DOI matches its Crossref record.
Some remarks on the theory of graphs
Open accessAbstract
Recently very much more general theorems have been proved by Grünwald and Milgram. 3 They in fact proved (among others) that the condition that G' contains no closed directed path is superfluous.We suppress the proof of Theorem Ha since it is essentially the same as that of Theorem II.(We only remark that a connected to b by a line directed from a to & should be replaced by a divides b.)
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
Cited by
Backstrom, L., Dwork, C., & Kleinberg, J. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242598 · Cited by 850
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
A fast and simple randomized parallel algorithm for the maximal independent set problem
Alon, N., Babai, L., & Itai, A. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90019-2 · Cited by 823
Edmonds polytopes and a hierarchy of combinatorial problems
Chvátal, V. (1973) · Discrete Mathematics · doi:10.1016/0012-365x(73)90167-2 · Cited by 624
Erdös, P. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_19 · Cited by 611
Self-citation
Metadata
- Authors
- Erdös, P.
- Venue
- Bulletin of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1947
- Volume
- 53
- Issue
- 4
- Pages
- 292-294
- ISSN
- 0002-9904 (ISSN-L)
- 0273-0979
- 1088-9485
- OpenAlex
- W2045472305
- Cited by
- 645
- References
- 0
- FWCI
- 1.03
- Type
- journal article
- Language
- en
- Open access
- diamond
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: Some remarks on the theory of graphs. https://app.cochat.ai/papers/10.1090/s0002-9904-1947-08785-1
- The paper
- Erdös, P. (1947). Some remarks on the theory of graphs. Bulletin of the American Mathematical Society. https://doi.org/10.1090/s0002-9904-1947-08785-1
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.