Mathematics – Combinatorics
Scientific paper
2001-01-29
Mathematics
Combinatorics
5 pages. This is Version 2: some mistakes are corrected; a more general version of the main theorem is presented
Scientific paper
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.
No associations
LandOfFree
Remarks on a Paper by Y.Caro and R.Yuster on Turan Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Remarks on a Paper by Y.Caro and R.Yuster on Turan Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Remarks on a Paper by Y.Caro and R.Yuster on Turan Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-726795