The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
On the combinatorial problems which I would most like to see solved
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
(1973) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(09)x7013-3 · Cited by 2,937
Polynomial algorithms in linear programming
Khachiyan, L. G. (1980) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(80)90061-0 · Cited by 1,992
Welsh, D. J. A. (1974) · Bulletin of the London Mathematical Society · doi:10.1112/blms/6.2.218b · Cited by 1,046
Latin Squares and their Applications
Keedwell, A. D., & Dénes, J. (2015) · Elsevier eBooks · doi:10.1016/c2014-0-03412-0 · Cited by 1,042
Every planar map is four colorable. Part I: Discharging
Appel, K., & Haken, W. (1977) · Illinois Journal of Mathematics · doi:10.1215/ijm/1256049011 · Cited by 884
Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions
Furstenberg, H. (1977) · Journal d Analyse Mathématique · doi:10.1007/bf02813304 · Cited by 804
On sets of integers containing k elements in arithmetic progression
Szemerédi, E. (1975) · Acta Arithmetica · doi:10.4064/aa-27-1-199-245 · Cited by 798
Intersection Theorems for Systems of Sets
Erdös, P., & Rado, R. (1960) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-35.1.85 · Cited by 626
Self-citationBollobás, B. (1979) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-9967-7 · Cited by 610
Roth, K. F. (1953) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-28.1.104 · Cited by 586
Hamiltonian circuits in random graphs
Pósa, L. (1976) · Discrete Mathematics · doi:10.1016/0012-365x(76)90068-6 · Cited by 453
A Mathematical Incompleteness in Peano Arithmetic
Paris, J. B. (1977) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)71130-3 · Cited by 426
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
Behrend, F. A. (1946) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.32.12.331 · Cited by 408
Erdös, P., & Turán, P. (1936) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-11.4.261 · Cited by 310
Self-citationThe Existence and Construction of Balanced Incomplete Block Designs
Hanani, H. (1961) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177705047 · Cited by 301
On the existence of a factor of degree one of a connected random graph
Erdős, P., & Rényi, A. (1966) · Acta Mathematica Academiae Scientiarum Hungaricae · doi:10.1007/bf01894879 · Cited by 189
Self-citationOn the existence of triangulated spheres in 3-graphs, and related problems
Sós, V. T., Erdős, P., & Brown, W. G. (1973) · Periodica Mathematica Hungarica · doi:10.1007/bf02018585 · Cited by 105
Self-citationCombinatorial properties of systems of sets
Erdös, P., & Szemerédi, E. (1978) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(78)90060-2 · Cited by 54
Self-citation
Cited by
New applications of the polynomial method: The cap set conjecture and beyond
Grochow, J. (2018) · Bulletin of the American Mathematical Society · doi:10.1090/bull/1648 · Cited by 16
Metadata
- Authors
- Erdős, P.
- Venue
- Combinatorica
- Published
- 1981-03
- Volume
- 1
- Issue
- 1
- Pages
- 25-42
- ISSN
- 0209-9683 (ISSN-L)
- 1439-6912
- OpenAlex
- W2169821423
- Cited by
- 313
- References
- 18
- FWCI
- 10.77
- 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
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.
