Remarks on a Paper by Y.Caro and R.Yuster on Turan Problem
Combinatorics
2007-05-23 v2
Abstract
Caro and Yuster (Electronic J.Comb 7 (2000)) studied a generalization of the Turan problem, where a certain function (instead of the size) of an F-free graph of order n has to be maximized. We prove that for a wide class of functions the asymptotics of the maximum is given by complete partite graphs.
Keywords
Cite
@article{arxiv.math/0101235,
title = {Remarks on a Paper by Y.Caro and R.Yuster on Turan Problem},
author = {Oleg Pikhurko},
journal= {arXiv preprint arXiv:math/0101235},
year = {2007}
}
Comments
5 pages. This is Version 2: some mistakes are corrected; a more general version of the main theorem is presented