Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-20T12:18:37.022Z Has data issue: false hasContentIssue false
  • English
  • Français

Maxima for Graphs and a New Proof of a Theorem of Turán

Published online by Cambridge University Press:  20 November 2018

T. S. Motzkin  and
E. G. Straus
T. S. Motzkin
Affiliation:
University of California, Los Angeles
E. G. Straus
Affiliation:
University of California, Los Angeles
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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 En given by xi ≥ 0, Σxi = 1. What is

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 17 , 1965 , pp. 533 - 540
Copyright
Copyright © Canadian Mathematical Society 1965

References

1. MacDonald, J. E. Jr J Problem E1643, Amer. Math. Monthly, 70 (1963), 1099.Google Scholar
2. Turán, P., On the theory of graphs, Colloq. Math., 3 (1954), 19–30.Google Scholar