Abstract

We show that among K_{k+1}-free n-vertex graphs, the Turán graph contains the most copies of any path.

Full Text
Paper version not known

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 call

Similar Papers

Paper Title
Journal
Date
Author
Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges
József Balogh ... Wojciech Samotij
SIAM Journal on Discrete Mathematics | VOL. 24
József Balogh, et. al.József Balogh ... Wojciech Samotij
01 Jan 2009
Closing Complexity Gaps for Coloring Problems on H-Free Graphs
Petr A Golovach ... Jian Song
-
Petr A Golovach, et. al.Petr A Golovach ... Jian Song
01 Jan 2012
Practical approximation schemes for maximum induced-subgraph problems on K 3,3-free or K 5-free graphs
Zhi-Zhong Chen
-
Zhi-Zhong ChenZhi-Zhong Chen
01 Jan 1996
Hamiltonian Cycles and 2-Factors in Tough Graphs Without Forbidden Subgraphs
Elizabeth Grimm
-
Elizabeth GrimmElizabeth Grimm
05 Jul 2022
View more papers

More From: Graphs and Combinatorics

Paper Title
Journal
Date
Author
Maximal Colourings for Graphs
Raffaella Mulas
Graphs and Combinatorics | VOL. 40
Raffaella MulasRaffaella Mulas
07 Aug 2024
Ramsey Numbers of Multiple Copies of Graphs in a Component
Caixia Huang ... Yiran Zhang
Graphs and Combinatorics | VOL. 40
Caixia Huang, et. al.Caixia Huang ... Yiran Zhang
07 Aug 2024
Independence Number and Maximal Chromatic Polynomials of Connected Graphs
Shude Long ... Junliang Cai
Graphs and Combinatorics | VOL. 40
Shude Long, et. al.Shude Long ... Junliang Cai
07 Aug 2024
Normalized Laplacian Eigenvalues of Hypergraphs
Leyou Xu ... Bo Zhou
Graphs and Combinatorics | VOL. -
Leyou Xu, et. al.Leyou Xu ... Bo Zhou
03 Aug 2024
View more papers