Linear Connectivity Forces Large Complete Bipartite Minors: the Patch for the Large Tree-Width Case

Details Linear Connectivity Forces Large Complete Bipartite Minors: the Patch for the Large Tree-Width Case Linear Connectivity Forces Large Complete Bipartite Minors: the Patch for the Large Tree-Width Case

2009-06-15

arxiv.org/abs/0906.2568v1

Mathematics

Combinatorics

8 pages

Scientific paper

The recent paper "Linear Connectivity Forces Large Complete Bipartite Minors" by Boehme et al. relies on a structure theorem for graphs with no H-minor. The sketch provided of how to deduce this theorem from the work of Robertson and Seymour appears to be incomplete. To fill this gap, we modify the main proof of that paper to work with a mere restatement of Robertson and Seymour's original results instead.

Affiliated with

Also associated with

No associations

Rating

Linear Connectivity Forces Large Complete Bipartite Minors: the Patch for the Large Tree-Width Case 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 Linear Connectivity Forces Large Complete Bipartite Minors: the Patch for the Large Tree-Width Case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Connectivity Forces Large Complete Bipartite Minors: the Patch for the Large Tree-Width Case will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-315358