The inducibility of blow-up graphs

Details The inducibility of blow-up graphs The inducibility of blow-up graphs

2011-08-29

arxiv.org/abs/1108.5699v1

Mathematics

Combinatorics

13 pages

Scientific paper

The blow-up of a graph is obtained by replacing every vertex with a finite collection of copies so that the copies of two vertices are adjacent if and only if the originals are. If every vertex is replaced with the same number of copies, then the resulting graph is called a balanced blow-up. We show that any graph which contains the maximum number of induced copies of a sufficiently large balanced blow-up of H is itself essentially a blow-up of H. This gives an asymptotic answer to a question in [BEHJ95].

Affiliated with

Also associated with

No associations

Rating

The inducibility of blow-up graphs 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 The inducibility of blow-up graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The inducibility of blow-up graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-127290