Title of article :
Excluding a planar graph from -representable matroids
Author/Authors :
Geelen، نويسنده , , Jim and Gerards، نويسنده , , Bert and Whittle، نويسنده , , Geoff، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2007
Abstract :
We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as a minor. This implies that an infinite antichain of binary matroids cannot contain the cycle matroid of a planar graph. The result also holds for any other finite field.
Keywords :
Grids , matroids , branch-width , Graph Minors
Journal title :
Journal of Combinatorial Theory Series B
Journal title :
Journal of Combinatorial Theory Series B