Roman Glebov
Published 2011-11-30Version 1
In this paper we deal with a Tur\'an-type problem: given a positive integer n and a forbidden graph H, how many edges can there be in a graph on n vertices without a subgraph H? How does a graph look like if it has this extremal edge number? The forbidden graph in this article is a clique-path: a path of length k where each edge is extended to an r-clique, r >2. We determine both the extremal number and the extremal graphs for sufficiently large n.
Comments: 12 pages, 7 figures
Extremal Graphs Without 4-Cycles
A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
Extremal graphs for vertex-degree-based invariants with given degree sequences
![QR code for arXiv:1111.7029 [math.CO]](http://oss.arxitics.com/images/favicon.svg)