
 Aa
 Aa
Ceyhan, Elvan 2016. Edge density of new graph types based on a random digraph family. Statistical Methodology,
Bollobás, Béla and Scott, Alex 2015. Intersections of hypergraphs. Journal of Combinatorial Theory, Series B, Vol. 110, p. 180.
Bollobás, Béla and Scott, Alex 2011. Intersections of graphs. Journal of Graph Theory, Vol. 66, Issue. 4, p. 261.
Sudakov, Benny 2007. Note making a K 4free graph bipartite. Combinatorica, Vol. 27, Issue. 4, p. 509.
Keevash, Peter Mubayi, Dhruv and Wilson, Richard M. 2006. Set Systems with No Singleton Intersection. SIAM Journal on Discrete Mathematics, Vol. 20, Issue. 4, p. 1031.
Keevash, Peter and Sudakov, Benny 2006. Sparse halves in trianglefree graphs. Journal of Combinatorial Theory, Series B, Vol. 96, Issue. 4, p. 614.
A celebrated theorem of Turán asserts that every graph on n vertices with more than $\frac{r\,{}\,1}{2r}n^2$ edges contains a copy of a complete graph $K_r+1$. In this paper we consider the following more general question. Let G be a $K_r+1free graph of order n and let α be a constant, 0<α≤1. How dense can every induced subgraph of G on αn vertices be? We prove the following local density extension of Turán's theorem.
For every integer $r\geq 2$ there exists a constant $c_r < 1$ such that, if $c_r < \alpha < 1$ and every αn vertices of G span more than
edges, then G contains a copy of $K_r+1$. This result is clearly best possible and answers a question of Erdős, Faudree, Rousseau and Schelp [5].
In addition, we prove that the only $K_r+1free graph of order n, in which every αn vertices span at least $\frac{r\,{}\,1}{2r}(2\alpha 1)n^2$ edges, is a Turán graph. We also obtain the local density version of the Erdős–Stone theorem.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.