Turan's Graph Theorem

DOI10.2307/2974509zbMath0843.05053WikidataQ56567572 ScholiaQ56567572MaRDI QIDQ4870046

Martin Aigner

Publication date: 17 March 1996

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2974509

zbMATH Keywords

extremal graphs; Turán's theorem

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

Related Items

Unnamed Item, Clique roots of K4-free chordal graphs, On clique values identities and mantel-type theorems, Strong Turán stability, Turán‐ and Ramsey‐type results for unavoidable subgraphs, Online team formation under different synergies, Bounding the feedback vertex number of digraphs in terms of vertex degrees, Balancing modular transfer lines with serial-parallel activation of spindle heads at stations, Branch and bound algorithm for a transfer line design problem: stations with sequentially activated multi-spindle heads, Nondifferentiability of the time constants of first-passage percolation, Spectral gaps, missing faces and minimal degrees, On the maxima of Motzkin-Straus programs and cliques of graphs, Continuous cubic formulations for cluster detection problems in networks, Maximizing expected powers of the angle between pairs of points in projective space, A note on Turán's theorem, On representing the positive semidefinite cone using the second-order cone, Convex hull of face vectors of colored complexes, On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs, A Turán-type problem on distances in graphs, Random algebraic construction of extremal graphs