Minors in expanding graphs

Details Minors in expanding graphs Minors in expanding graphs

2007-07-01

arxiv.org/abs/0707.0133v1

Mathematics

Combinatorics

Scientific paper

Extending several previous results we obtained nearly tight estimates on the
maximum size of a clique-minor in various classes of expanding graphs. These
results can be used to show that graphs without short cycles and other H-free
graphs contain large clique-minors, resolving some open questions in this area.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-692267