Abstract
Given graphs T and H, the generalized Turán number ex(n,T,H) is the maximum number of copies of T in an n-vertex graph with no copies of H. Alon and Shikhelman, using a result of Erdős, determined the asymptotics of ex(n,K3,H) when the chromatic number of H is greater than three and proved several results when H is bipartite. We consider this problem when H has chromatic number three. Even this special case for the following relatively simple three chromatic graphs appears to be challenging. The suspension Hˆ of a graph H is the graph obtained from H by adding a new vertex adjacent to all vertices of H. We give new upper and lower bounds on ex(n,K3,Hˆ) when H is a path, even cycle, or complete bipartite graph. One of the main tools we use is the triangle removal lemma, but it is unclear if much stronger statements can be proved without using the removal lemma.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
