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

1965/01/01 by T. S. Motzkin, E. G. Straus · 7 citations
Mathematics · Computer Science · #Graph theory and applications #Advanced Graph Theory Research #Limits and Structures in Graph Theory #Mathematics #Simplex #Combinatorics #Graph #Square (algebra) #Quadratic equation #Discrete mathematics #Geometry

paper · pdf · doi:10.4153/cjm-1965-053-6

openalex publication_date 1965/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

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

Cited by

• An approximation notion between P and FPTAS
• On a conjecture of Hefetz and Keevash on Lagrangians of intersecting hypergraphs and Turán numbers
• How Hard Is It to Approximate the Best Nash Equilibrium?
• The clique density theorem
• Data clustering: 50 years beyond K-means
• Finding All Maximal Cliques in Dynamic Graphs
• Turán's theorem [wikipedia]