K_6 minors in 6-connected graphs of bounded tree-width

Details K_6 minors in 6-connected graphs of bounded tree-width K_6 minors in 6-connected graphs of bounded tree-width

2012-03-09

arxiv.org/abs/1203.2171v1

Mathematics

Combinatorics

33 pages, 8 figures

Scientific paper

We prove that every sufficiently big 6-connected graph of bounded tree-width
either has a K_6 minor, or has a vertex whose deletion makes the graph planar.
This is a step toward proving that the same conclusion holds for all
sufficiently big 6-connected graphs. Jorgensen conjectured that it holds for
all 6-connected graphs.

Affiliated with

Also associated with

No associations

Rating

K_6 minors in 6-connected graphs of bounded tree-width 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 K_6 minors in 6-connected graphs of bounded tree-width, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and K_6 minors in 6-connected graphs of bounded tree-width will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-487926