An extension of Turán's theorem, uniqueness and stability

From MaRDI portal
(Redirected from Publication:463041)




Abstract: We determine the maximum number of edges of an n-vertex graph G with the property that none of its r-cliques intersects a fixed set MsubsetV(G). For (r1)|M|gen, the (r1)-partite Turan graph turns out to be the unique extremal graph. For (r1)|M|<n, there is a whole family of extremal graphs, which we describe explicitly. In addition we provide corresponding stability results.









This page was built for publication: An extension of Turán's theorem, uniqueness and stability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463041)