Abstract
Let denote the maximum number of induced copies of 5-cycles in graphs on vertices. For large enough, we show that , where and are as equal as possible. Moreover, if is a power of 5, we show that the unique graph on vertices maximizing the number of induced 5-cycles is an iterated blow-up of a 5-cycle.
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.