Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 31Advanced Combinatorial MathematicsLimits and Structures in Graph TheoryAnalytic Number Theory Research

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

On a combinatorial problem of Erdös, Ginzburg, and Ziv

Open access
Olson, John E·1976·Journal of Number Theory

Overview

Integrity signals

Registry

Crossref · 10.1016/0022-314x(76)90021-4

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 3 references

Cited by

See all 31

Metadata

Authors
Olson, J. E.
Affiliations
Pennsylvania State University (US)
Corresponding author
Olson, John E
Venue
Journal of Number Theory
Publisher
Elsevier BV
Published
1976-02
Volume
8
Issue
1
Pages
52-57
ISSN
0022-314X (ISSN-L)
OpenAlex
W2013548241
Cited by
31
References
3
Citations by year
2026: 1 · 2025: 2 · 2024: 2 · 2022: 1 · 2021: 1 · 2019: 1 · 2018: 1 · 2015: 1 · 2013: 1
FWCI
0.00
Type
journal article
Language
en
Open access
Licence
Locations
Journal of Number Theory (publishedVersion)
Topics
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
  • Physical Sciences › Mathematics › Algebra and Number Theory › Analytic Number Theory Research
Keywords
Erdős-Ginzburg-Ziv theorem, zero-sum problems, finite groups, additive combinatorics, zero-sum subsequences

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: On a combinatorial problem of Erdös, Ginzburg, and Ziv. https://app.cochat.ai/papers/10.1016/0022-314x(76)90021-4
The paper
Olson, J. E. (1976). On a combinatorial problem of Erdös, Ginzburg, and Ziv. Journal of Number Theory. https://doi.org/10.1016/0022-314x(76)90021-4

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.