A generalization of Turán's theorem
From MaRDI portal
Publication:5462387
DOI10.1002/jgt.20074zbMath1066.05079OpenAlexW4249923855MaRDI QIDQ5462387
Tibor Szabó, Van H. Vu, Benjamin Sudakov
Publication date: 1 August 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20074
Related Items (12)
On the spectral moment of graphs with given clique number ⋮ Turán's theorem for pseudo-random graphs ⋮ Sharp bounds for the signless Laplacian spectral radius in terms of clique number ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ New results for MaxCut in H$H$‐free graphs ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ A note on pseudorandom Ramsey graphs ⋮ The asymptotics of \(r(4,t)\) ⋮ Extremal results in sparse pseudorandom graphs ⋮ A construction for clique-free pseudorandom graphs ⋮ Extremal results for odd cycles in sparse pseudorandom graphs ⋮ Near-perfect clique-factors in sparse pseudorandom graphs
Cites Work
This page was built for publication: A generalization of Turán's theorem
