Abstract
Given an -chromatic graph and a graph that does not contain as a subgraph, we say that is strictly -Turán-good if the Turán graph is the unique graph containing the maximum number of copies of among all -free graphs on vertices for every large enough. Győri, Pach and Simonovits (1991) proved that cycle of length four is strictly -Turán-good for all . In this article, we extend this result and show that is strictly -Turán-good, where is an -chromatic graph with and a color-critical edge. Moreover, we show that every -vertex -free graph with $N(H,G)=\ex(n,C_4,F)-o(n^4)$ can be obtained by adding or deleting edges from . Our proof uses the flag algebra method developed by Razborov (2007).
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.