Work

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

Year: 1965
Type: article
Abstract: 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
Language: English
Open Access status: bronze
OpenAlex ID: W2027470314
FWCI:
Cites: 1
Cited by: 714
Related to: 10