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

From MaRDI portal
Publication:463041

zbMATH Open1298.05169arXiv1403.3801MaRDI QIDQ463041FDOQ463041


Authors: Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet Edit this on Wikidata


Publication date: 23 October 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1403.3801

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (4)





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)