arXiv Analytics

Sign in

arXiv:math/0101235 [math.CO]AbstractReferencesReviewsResources

Remarks on a Paper by Y.Caro and R.Yuster on Turan Problem

Oleg Pikhurko

Published 2001-01-29, updated 2004-04-21Version 2

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.

Comments: 5 pages. This is Version 2: some mistakes are corrected; a more general version of the main theorem is presented
Categories: math.CO
Subjects: 05C35
Related articles: Most relevant | Search more
arXiv:1311.6291 [math.CO] (Published 2013-11-25, updated 2015-11-12)
A generalization of weight polynomials to matroids
arXiv:1310.0851 [math.CO] (Published 2013-10-02, updated 2014-04-04)
A generalization of Aztec diamond theorem, part I
arXiv:math/0604280 [math.CO] (Published 2006-04-12, updated 2006-10-05)
Generalization of an Identity of Andrews

Links

Toolbox