Abstract
AbstractIn the so-called generalized Turán problems we study the largest number of copies of H in an n-vertex F-free graph G. Here we introduce a variant, where F is not forbidden, but we restrict how copies of H and F can be placed in G. More precisely, given an integer n and graphs H and F, what is the largest number of copies of H in an n-vertex graph such that the vertex set of that copy does not contain and is not contained in the vertex set of a copy of F? We solve this problem for some instances, give bounds in other instances, and we use our results to determine the generalized Turán number for some pairs of graphs.
Sign-in/Register to access full text options 
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.
