Extremal graphs for clique-paths
Combinatorics
2011-12-01 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1111.7029,
title = {Extremal graphs for clique-paths},
author = {Roman Glebov},
journal= {arXiv preprint arXiv:1111.7029},
year = {2011}
}
Comments
12 pages, 7 figures