Matroid 3-connectivity and branch width

Details Matroid 3-connectivity and branch width Matroid 3-connectivity and branch width

2011-07-20

arxiv.org/abs/1107.3914v1

Mathematics

Combinatorics

21 pages

Scientific paper

We prove that, for each nonnegative integer k and each matroid N, if M is a
3-connected matroid containing N as a minor, and the the branch width of M is
sufficiently large, then there is a k-element subset X of E(M) such that one of
M\X and M/X is 3-connected and contains N as a minor.

Affiliated with

Also associated with

No associations

Rating

Matroid 3-connectivity and branch 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 Matroid 3-connectivity and branch width, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Matroid 3-connectivity and branch width will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-34557