Abstract
AbstractLet denote the maximum number of copies of possible in an ‐vertex planar graph. The function has been determined when is a cycle of length 3 or 4 by Hakimi and Schmeichel and when is a complete bipartite graph with smaller part of size 1 or 2 by Alon and Caro. We determine exactly in the case when is a path of length 3.
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.
