An obstacle to a decomposition theorem for near-regular matroids

Details An obstacle to a decomposition theorem for near-regular matroids An obstacle to a decomposition theorem for near-regular matroids

2009-05-20

arxiv.org/abs/0905.3252v3

Mathematics

Combinatorics

11 pages, 1 figure

Scientific paper

Seymour's Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obtained from matroids that belong to a few basic classes through k-sums. Also suppose that these basic classes are such that, whenever a class contains all graphic matroids, it does not contain all cographic matroids. We show that in that case 3-sums will not suffice.

Affiliated with

Also associated with

No associations

Rating

An obstacle to a decomposition theorem for near-regular matroids 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 An obstacle to a decomposition theorem for near-regular matroids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An obstacle to a decomposition theorem for near-regular matroids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-242429