Remarks on a Paper by Y.Caro and R.Yuster on Turan Problem
Oleg Pikhurko
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.
Create a lesson
Related papers
Decay-Ramsey Sequences
Francesco Di Braccio, Simon Griffiths, Pedram Noohi et al.
Hypergraphs with the smallest Hall ratio are still hard to colour
Veronica Bitonti, Freddie Illingworth, Pedram Noohi et al.
The k-color poset Ramsey number of the diamond is 2k
Tom Bohman, Will Cong, Quentin Dubroff et al.
Intersecting families of loose spanning hypertrees
Yury Person, Thomas Schweser
The terminal leave in random greedy hypergraph matching
Peter Keevash
Two Perfect One-Factorizations of K92
Tomasz Maciosowski