Abstract
An extremal graph for a given graph H is a graph with the maximum number of edges among all H-free graphs with fixed number of vertices. The pth power of a path is a graph obtained from a path by joining all pairs of vertices with distance at most p. Applying a deep theorem of Simonovits, we characterize the extremal graphs for the pth power of paths. This settles a conjecture posed by Xiao, Katona, Xiao and Zamora in a stronger form.
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.
