Complete Graph Minors and the Graph Minor Structure Theorem

Details Complete Graph Minors and the Graph Minor Structure Theorem Complete Graph Minors and the Graph Minor Structure Theorem

2011-05-18

arxiv.org/abs/1105.3549v1

Mathematics

Combinatorics

Scientific paper

The graph minor structure theorem by Robertson and Seymour shows that every graph that excludes a fixed minor can be constructed by a combination of four ingredients: graphs embedded in a surface of bounded genus, a bounded number of vortices of bounded width, a bounded number of apex vertices, and the clique-sum operation. This paper studies the converse question: What is the maximum order of a complete graph minor in a graph constructed using these four ingredients? Our main result is a precise answer to this question.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-53583