The DOI matches its Crossref record.
A constructive proof of Tucker's combinatorial lemma
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.
Integrity signals
Registry
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.
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
“These adjacent vertices may be found efficiently using the algorithm of Freund and Todd [6], or more recent methods found in [17].”
From Consensus-halving via theorems of Borsuk-Ulam and Tucker (2003) · cites this paper as [6]
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: 5
- Barany, 1980, Borsuk's theorem through complementary pivoting, Math. Programming, 18, 84, 10.1007/BF01588299 · doi:10.1007/bf01588299
- Cohen, 1979, On the combinatorial antipodal-point lemmas, J. Combin. Theory Ser. B, 27, 87, 10.1016/0095-8956(79)90071-6 · doi:10.1016/0095-8956(79)90071-6
- Meyerson, 1979, A new and constructive proof of the Borsuk-Ulam theorem, Amer. Math. Soc., 73, 134, 10.1090/S0002-9939-1979-0512075-9 · doi:10.1090/s0002-9939-1979-0512075-9
- M. J. Todd and A. H. Wright, A variable-dimension simplicial algorithm for antipodal fixed-point theorems, Num. Funct. Anal. Optim., in press. · doi:10.1080/01630568008816052
- Tucker, 1944, Antipodal-point theorems proved by an elementary lemma, Bull. Amer. Math. Soc., 50, 681
Cited by
On the complexity of the parity argument and other inefficient proofs of existence
Papadimitriou, C. H. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80063-7 · Cited by 778
Consensus-halving via theorems of Borsuk-Ulam and Tucker
Simmons, F. W., & Su, F. E. (2003) · Mathematical Social Sciences · doi:10.1016/s0165-4896(02)00087-2 · Cited by 74
Metadata
- Authors
- Freund, R. M., & Todd, M. J.
- Venue
- Journal of Combinatorial Theory, Series A
- Publisher
- Elsevier BV
- Published
- 1981-05
- Volume
- 30
- Issue
- 3
- Pages
- 321-325
- ISSN
- 0097-3165
- Cited by
- 41
- References
- 0
- Language
- en
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 11765 d)
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 constructive proof of Tucker's combinatorial lemma. https://app.cochat.ai/papers/10.1016/0097-3165(81)90027-3
- The paper
- Freund, R. M., & Todd, M. J. (1981). A constructive proof of Tucker's combinatorial lemma. Journal of Combinatorial Theory, Series A. https://doi.org/10.1016/0097-3165(81)90027-3
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.