The DOI matches its Crossref record.
Maxima for Graphs and a New Proof of a Theorem of Turán
Open accessAbstract
Maximum of a square-free quadratic form on a simplex. The following question was suggested by a problem of J. E. MacDonald Jr. (1): Given a graph G with vertices 1, 2, . . . , n. Let S be the simplex in E n given by x i ≥ 0, Σ x i = 1. What is
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
Cited by
On the Computational Complexity of Stochastic Controller Optimization in POMDPs
Vlassis, N., Littman, M. L., & Barber, D. (2012) · ACM Transactions on Computation Theory · doi:10.1145/2382559.2382563 · Cited by 65
Integrating many co-splicing networks to reconstruct splicing regulatory modules
Dai, C., Li, W., Liu, J., & Zhou, X. J. (2012) · BMC Systems Biology · doi:10.1186/1752-0509-6-s1-s17 · Cited by 20
Tumor stratification by a novel graph-regularized bi-clique finding algorithm
Ahmadi Adl, A., & Qian, X. (2015) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2015.02.010 · Cited by 3
Metadata
- Authors
- Motzkin, T. S., & Straus, E. G.
- Venue
- Canadian Journal of Mathematics
- Publisher
- Canadian Mathematical Society
- Published
- 1965
- Volume
- 17
- Pages
- 533-540
- ISSN
- 0008-414X (ISSN-L)
- 1496-4279
- OpenAlex
- W2027470314
- Cited by
- 710
- References
- 0
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Maxima for Graphs and a New Proof of a Theorem of Turán. https://app.cochat.ai/papers/10.4153/cjm-1965-053-6
- The paper
- Motzkin, T. S., & Straus, E. G. (1965). Maxima for Graphs and a New Proof of a Theorem of Turán. Canadian Journal of Mathematics. https://doi.org/10.4153/cjm-1965-053-6
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.
