K_6 minors in large 6-connected graphs

Details K_6 minors in large 6-connected graphs K_6 minors in large 6-connected graphs

2012-03-09

arxiv.org/abs/1203.2192v1

Mathematics

Combinatorics

47 pages, 11 figures

Scientific paper

Jorgensen conjectured that every 6-connected graph with no K_6 minor has a
vertex whose deletion makes the graph planar. We prove the conjecture for all
sufficiently large graphs.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-488067