paper

Some exact results for non-degenerate generalized Turán problems

arXiv:2209.03426

Abstract

The generalized Turán number is the maximum number of copies of in -vertex -free graphs. We consider the case where . There are several exact results on when the extremal graph is a complete -partite graph. We obtain multiple exact results with other kinds of extremal graphs.

Some exact results for non-degenerate generalized Turán problems · wovepaper