Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

JCT
2007

favoriteEmaildiscussreport

118views more JCT 2007»

Excluding a planar graph from GF(q)-representable matroids

13 years 10 months ago

Excluding a planar graph from GF(q)-representable matroids

Download www.math.uwaterloo.ca

Abstract. We prove that a binary matroid with huge branchwidth contains the cycle matroid of a large grid as a minor. This implies that an inﬁnite antichain of binary matroids cannot contain the cycle matroid of a planar graph. The result also holds for any other ﬁnite ﬁeld.

Jim Geelen, Bert Gerards, Geoff Whittle

Real-time Traffic

Huge Branchwidth | JCT 2007 | Large Grid | Matroid |

claim paper

Related Content

» Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor

» On the Complexity of Matroid Isomorphism Problem

» Matroid Pathwidth and Code Trellis Complexity

» A Separator Theorem for Graphs with an Excluded Minor and its Applications

» Planar minimally rigid graphs and pseudotriangulations

» Counting Subgraphs via Homomorphisms

» Beyond Bidimensionality Parameterized Subexponential Algorithms on Directed Graphs

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JCT
Authors	Jim Geelen, Bert Gerards, Geoff Whittle

Comments (0)