Graphs with many copies of a given subgraph

Details Graphs with many copies of a given subgraph Graphs with many copies of a given subgraph

2007-11-22

arxiv.org/abs/0711.3493v1

Mathematics

Combinatorics

Scientific paper

We show that if a graph G of order n contains many copies of a given subgraph
H, then it contains a blow-up of H of order log n.

Affiliated with

Also associated with

No associations

Rating

Graphs with many copies of a given subgraph 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 Graphs with many copies of a given subgraph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphs with many copies of a given subgraph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-310075