On a theorem of Erd\H{o}s and Simonovits on graphs not containing the cube
Combinatorics
2013-07-04 v1
Abstract
The cube Q is the usual 8-vertex graph with 12 edges. Here we give a new proof for a theorem of Erd\H{o}s and Simonovits concerning the Tur\'an number of the cube. Namely, it is shown that e(G) < n^{8/5}+(2n)^{3/2} holds for any n-vertex cube-free graph G. Our aim is to give a self-contained exposition. We also point out the best known results and supply bipartite versions.
Keywords
Cite
@article{arxiv.1307.1062,
title = {On a theorem of Erd\H{o}s and Simonovits on graphs not containing the cube},
author = {Zoltán Füredi},
journal= {arXiv preprint arXiv:1307.1062},
year = {2013}
}
Comments
15 pages. This is the preliminary version of my article in the Turan memorial volume