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

The DOI matches its Crossref record.

A generalization of Kneser's Addition Theorem

DeVos, Matt, Goddyn, Luis, Mohar, Bojan · 2009 · Advances in Mathematics

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.1016/j.aim.2008.11.003

Cites

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

No references could be resolved yet.

Research works printed but not linked: 19

  1. Bialostocki, 1990, Zero sum Ramsey theorems, Congr. Numer., 70, 119
  2. Bialostocki, 1992, On the Erdős–Ginzburg–Ziv Theorem and the Ramsey numbers for stars and matchings, Discrete Math., 110, 1, 10.1016/0012-365X(92)90695-C · DOI · Paper page
  3. Bollobás, 1999, The number of k-sums modulo k, J. Number Theory, 78, 27, 10.1006/jnth.1999.2405 · DOI
  4. Cao, 2006, An addition theorem on the cyclic group Zpαqβ, Electron. J. Combin., 13, N9, 10.37236/1147 · doi:10.37236/1147
  5. Cauchy, 1813, Recherches sur les nombres, J. École Polytech., 9, 99
  6. Davenport, 1935, On the addition of residue classes, J. London Math. Soc., 10, 30, 10.1112/jlms/s1-10.37.30 · DOI
  7. Erdős, 1961, Theorem in the additive number theory, Bull. Res. Council, 10F, 41
  8. Füredi, 1992, On zero-trees, J. Graph Theory, 16, 107, 10.1002/jgt.3190160202 · doi:10.1002/jgt.3190160202
  9. Gao, 1996, A combinatorial problem on finite abelian groups, J. Number Theory, 58, 100, 10.1006/jnth.1996.0067 · DOI · Paper page
  10. W.D. Gao, Three addition theorems on Zn, preprint
  11. Gao, 2008, Addition theorems on the cyclic groups of order pl, Discrete Math., 308, 2030, 10.1016/j.disc.2007.04.040 · DOI
  12. Grynkiewicz, 2005, On a partition analog of the Cauchy–Davenport Theorem, Acta Math. Hungar., 107, 167, 10.1007/s10474-005-0185-z · DOI
  13. Grynkiewicz, 2005, On a conjecture of Hamidoune for subsequence sums, Integers, 5, A07
  14. Hamidoune, 2003, Subsequence sums, Combin. Probab. Comput., 12, 413, 10.1017/S0963548302005564 · DOI
  15. Hamidoune, 1998, On a combinatorial theorem of Erdős, Ginzburg, and Ziv, Combin. Probab. Comput., 7, 403, 10.1017/S0963548398003721 · DOI
  16. Kneser, 1953, Abschätzung der asymptotischen Dichte von Summenmengen, Math. Z., 58, 459, 10.1007/BF01174162 · doi:10.1007/bf01174162
  17. Nathanson, 1996, Additive Number Theory. Inverse Problems and the Geometry of Sumsets, vol. 165
  18. Schrijver, 1990, Spanning trees of different weights, vol. 1, 281
  19. Schrijver, 1991, A simpler proof and a generalization of the zero-trees theorem, J. Combin. Theory Ser. A, 58, 301, 10.1016/0097-3165(91)90063-M · doi:10.1016/0097-3165(91)90063-m

Cited by

See all 29

Metadata

Authors
DeVos, M., Goddyn, L., & Mohar, B.
Venue
Advances in Mathematics
Publisher
Elsevier BV
Published
2009-03
Volume
220
Issue
5
Pages
1531-1548
ISSN
0001-8708
Cited by
29
References
0
Language
en
Licence

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: A generalization of Kneser's Addition Theorem. https://app.cochat.ai/papers/10.1016/j.aim.2008.11.003
The paper
DeVos, M., Goddyn, L., & Mohar, B. (2009). A generalization of Kneser's Addition Theorem. Advances in Mathematics. https://doi.org/10.1016/j.aim.2008.11.003

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.