Forcing large complete minors in infinite graphs

Details Forcing large complete minors in infinite graphs Forcing large complete minors in infinite graphs

2011-02-02

arxiv.org/abs/1102.0552v1

Mathematics

Combinatorics

12 pages, 2 figures

Scientific paper

It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end degree, which had been previously introduced by the first author for locally finite graphs, and show that large minimum relative degree at the ends and large minimum degree at the vertices imply the existence of large complete (topological) minors in infinite graphs with countably many ends.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-426756