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

dc.creatorPikhurko, Oleg
dc.date2001-01-29
dc.date2004-04-21
dc.date.accessioned2026-07-07T04:39:51Z
dc.date.available2026-07-07T04:39:51Z
dc.descriptionCaro 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.
dc.description5 pages. This is Version 2: some mistakes are corrected; a more general version of the main theorem is presented
dc.identifierhttps://arxiv.org/abs/math/0101235
dc.identifierhttp://arxiv.org/abs/math/0101235
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60840
dc.subjectCombinatorics
dc.subject05C35
dc.titleRemarks on a Paper by Y.Caro and R.Yuster on Turan Problem
dc.typetext

Files

Collections