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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.