Excluding Kuratowski graphs and their duals from binary matroids

Details Excluding Kuratowski graphs and their duals from binary matroids Excluding Kuratowski graphs and their duals from binary matroids

2009-02-02

arxiv.org/abs/0902.0198v1

Mathematics

Combinatorics

48 pages, 10 figures

Scientific paper

We consider various applications of our characterization of the internally 4-connected binary matroids with no M(K3,3)-minor. In particular, we characterize the internally 4-connected members of those classes of binary matroids produced by excluding any collection of cycle and bond matroids of K3,3 and K5, as long as that collection contains either M(K3,3) or M*(K3,3). We also present polynomial-time algorithms for deciding membership of these classes, where the input consists of a matrix with entries from GF(2). In addition we characterize the maximum-sized simple binary matroids with no M(K3,3)-minor, for any particular rank, and we show that a binary matroid with no M(K3,3)-minor has a critical exponent over GF(2) of at most four.

Affiliated with

Also associated with

No associations

Rating

Excluding Kuratowski graphs and their duals from binary 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 Excluding Kuratowski graphs and their duals from binary matroids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Excluding Kuratowski graphs and their duals from binary matroids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-159143