Remarks on a Paper by Y.Caro and R.Yuster on Turan Problem
classification
🧮 math.CO
keywords
caroproblemturanyusterasymptoticscertainclasscomb
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.