Abstract
AbstractWe show that among $$K_{k+1}$$
K
k
+
1
-free n-vertex graphs, the Turán graph contains the most copies of any path.
Funder
Nemzeti Kutatási Fejlesztési és Innovációs Hivatal
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Some Exact Results for Non-Degenerate Generalized Turán Problems;The Electronic Journal of Combinatorics;2023-12-15
2. Every graph is eventually Turán-good;Journal of Combinatorial Theory, Series B;2023-09
3. On weakly Turán-good graphs;Discussiones Mathematicae Graph Theory;2023