Extremal graphs for clique-paths

Details Extremal graphs for clique-paths Extremal graphs for clique-paths

2011-11-30

arxiv.org/abs/1111.7029v1

Mathematics

Combinatorics

12 pages, 7 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Extremal graphs for clique-paths does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Extremal graphs for clique-paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extremal graphs for clique-paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-6781