Abstract
Let F be a family of graphs. A graph is called F-free if it does not contain any member of F as a subgraph. The Turán number of F is the maximum number of edges in an n-vertex F-free graph and is denoted by ex(n,F). The same maximum under the additional condition that the graphs are connected is exconn(n,F). Let Pk be the path on k vertices, Km be the clique on m vertices. We determine ex(n,{Pk,Km}) if k>2m−1 and exconn(n,{Pk,Km}) if k>m for sufficiently large n.
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.
