• Title of article

    Obstructions to branch-decomposition of matroids

  • Author/Authors

    Geelen، نويسنده , , J. and Gerards، نويسنده , , B. and Robertson، نويسنده , , N. and Whittle، نويسنده , , G.، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2006
  • Pages
    11
  • From page
    560
  • To page
    570
  • Abstract
    A ( δ , γ ) -net in a matroid M is a pair ( N , P ) where N is a minor of M, P is a set of series classes in N, | P | ⩾ δ , and the pairwise connectivity, in M, between any two members of P is at least γ. We prove that, for any finite field F , nets provide a qualitative characterization for branch-width in the class of F -representable matroids. That is, for an F -representable matroid M, we prove that: (1) if M contains a ( δ , γ ) -net where δ and γ are both very large, then M has large branch-width, and, conversely, (2) if the branch-width of M is very large, then M or M ∗ contains a ( δ , γ ) -net where δ and γ are both large.
  • Keywords
    branch-width , matroids , connectivity
  • Journal title
    Journal of Combinatorial Theory Series B
  • Serial Year
    2006
  • Journal title
    Journal of Combinatorial Theory Series B
  • Record number

    1527707