The DOI matches its Crossref record; 9 of the 10 references it cites were found in a registry or an index.
Splitting necklaces
Open accessOverview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Our algorithm also provides a constructive solution to the discrete problem of 'splitting necklaces' [1].”
From Consensus-halving via theorems of Borsuk-Ulam and Tucker (2003) · cites this paper as [1]
Citations
Cites
Drei Sätze über die n-dimensionale euklidische Sphäre
Borsuk, K. (1933) · Fundamenta Mathematicae · doi:10.4064/fm-20-1-177-190 · Cited by 516
A framework for solving VLSI graph layout problems
Bhatt, S. N., & Leighton, F. T. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90071-0 · Cited by 438
On a Topological Generalization of a Theorem of Tverberg
Bárány, I., Shlosman, S. B., & Szűcs, A. (1981) · Journal of the London Mathematical Society · doi:10.1112/jlms/s2-23.1.158 · Cited by 156
The Chromatic Number of Kneser Hypergraphs
Alon, N., Frankl, P., & Lovász, L. (1986) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1986-0857448-8 · Cited by 127
Self-citationThe Borsuk-Ulam Theorem and Bisection of Necklaces
Alon, N., & West, D. B. (1986) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1986-0861764-9 · Cited by 88
Self-citationBourgin, D. G. (1963) · Macmillan eBooks · Cited by 79
Goldberg, C. H., & West, D. B. (1985) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0606010 · Cited by 69
Bhatt, S. N., & Leiserson, C. E. (1984) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 60
A moment problem in 𝐿₁ approximation
Hobby, C. R., & Rice, J. R. (1965) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1965-0178292-5 · Cited by 3
Cited by
Algorithmic construction of sets for k -restrictions
Alon, N., Moshkovitz, D., & Safra, M. (2006) · ACM Transactions on Algorithms · doi:10.1145/1150334.1150336 · Cited by 295
Self-citationCake cutting: not just child's play
Procaccia, A. D. (2013) · Communications of the ACM · doi:10.1145/2483852.2483870 · Cited by 156
Fair enough: guaranteeing approximate maximin shares
Procaccia, A. D., & Wang, J. (2014) · ACM Conference on Economics and Computation (EC) · doi:10.1145/2600057.2602835 · Cited by 151
Fair Enough: Guaranteeing Approximate Maximin Shares
Kurokawa, D., Procaccia, A. D., & Wang, J. (2018) · Journal of the ACM · doi:10.1145/3140756 · Cited by 150
The Chromatic Number of Kneser Hypergraphs
Alon, N., Frankl, P., & Lovász, L. (1986) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1986-0857448-8 · Cited by 127
Self-citation
Metadata
- Authors
- Alon, N.
- Affiliations
- Tel Aviv University (IL)
- Corresponding author
- Alon, Noga
- ORCID
- Alon, Noga
- Venue
- Advances in Mathematics
- Publisher
- Elsevier BV
- Published
- 1987-03
- Volume
- 63
- Issue
- 3
- Pages
- 247-253
- ISSN
- 0001-8708 (ISSN-L)
- OpenAlex
- W4206085806
- Cited by
- 136
- References
- 10
- Citations by year
- 2026: 9 · 2025: 11 · 2024: 8 · 2023: 9 · 2022: 6 · 2021: 12 · 2020: 12 · 2019: 10 · 2018: 5 · 2017: 6 · 2016: 2 · 2015: 4 · 2014: 3 · 2013: 5 · 2012: 12
- FWCI
- 0.68
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 9635 d)
- Locations
- Advances in Mathematics (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
- Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Game Theory and Voting Systems
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
- Keywords
- Borsuk-Ulam theorem, topological combinatorics, L1 approximation, interval partitioning
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: Splitting necklaces. https://app.cochat.ai/papers/10.1016/0001-8708(87)90055-7
- The paper
- Alon, N. (1987). Splitting necklaces. Advances in Mathematics. https://doi.org/10.1016/0001-8708(87)90055-7
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.
