An extension of the Erdős-Stone theorem
type: Item
instance of: scholarly article
title: An extension of the Erdős-Stone theorem
zbMATH Open document ID: 0813.05035
DOI: 10.1007/BF01212976
author: Béla Bollobás
author: Yoshiharu Kohayakawa
published in: Combinatorica
publication date: 1995-01-29T00:00:00Z
review text: The following extension of the Erdős-Stone theorem is presented: There is an absolute constant \(\alpha> 0\) such that, for all \(r\geq 1\), \(0< \beta< 1\) and \(0< \varepsilon\leq 1/r\), every graph \(G\) of sufficiently large order \(n\) with at least \((1- {1\over r}+ \varepsilon)(\begin{smallmatrix} n\\ 2\end{smallmatrix})\) edges contains a complete \((r+ 1)\)-partite graph \(K_{r+ 1}(s,m,\dots, m,t)\), where \(m= m(n)= \lfloor \alpha(1- \beta)(\log n)/\log r\rfloor\), \(s= s(n)= \lfloor \alpha(1- \beta)(\log n)r\log (1/\varepsilon)\rfloor\), and \(t= t(n)= \lfloor a\varepsilon^{1+ \beta/2} n^ \beta\rfloor\).
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 700950
zbMATH Keywords: Erdős-Stone theorem
reviewed by: Peter Horák
MaRDI profile type: Publication
cites work: On the Structure of Edge Graphs
cites work: On the Structure of Edge Graphs II
cites work: On the Erdös-Stone Theorem
cites work: On the structure of linear graphs
full work available at URL: https://doi.org/10.1007/bf01212976
OpenAlex ID: W27483122
description: scientific article; zbMATH DE number 700950