Turan's Graph Theorem
From MaRDI portal
Publication:4870046
DOI10.2307/2974509zbMath0843.05053OpenAlexW4256497955WikidataQ56567572 ScholiaQ56567572MaRDI QIDQ4870046
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
Related Items (21)
On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs ⋮ Random algebraic construction of extremal graphs ⋮ A Turán-type problem on distances in graphs ⋮ On representing the positive semidefinite cone using the second-order cone ⋮ Turán‐ and Ramsey‐type results for unavoidable subgraphs ⋮ Nondifferentiability of the time constants of first-passage percolation ⋮ Online team formation under different synergies ⋮ Asymptotic bounds for clustering problems in random graphs ⋮ Convex hull of face vectors of colored complexes ⋮ Strong Turán stability ⋮ Bounding the feedback vertex number of digraphs in terms of vertex degrees ⋮ Spectral gaps, missing faces and minimal degrees ⋮ A note on Turán's theorem ⋮ On clique values identities and mantel-type theorems ⋮ Balancing modular transfer lines with serial-parallel activation of spindle heads at stations ⋮ Unnamed Item ⋮ Branch and bound algorithm for a transfer line design problem: stations with sequentially activated multi-spindle heads ⋮ On the maxima of Motzkin-Straus programs and cliques of graphs ⋮ Clique roots of K4-free chordal graphs ⋮ Continuous cubic formulations for cluster detection problems in networks ⋮ Maximizing expected powers of the angle between pairs of points in projective space
This page was built for publication: Turan's Graph Theorem
