• Title of article

    Linked tree-decompositions of represented infinite matroids

  • Author/Authors

    Azzato، نويسنده , , Jeffrey، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2011
  • Pages
    18
  • From page
    123
  • To page
    140
  • Abstract
    We prove that a represented infinite matroid having finite tree-width w has a linked tree-decomposition of width at most 2w. This result should be a key lemma in showing that any class of infinite matroids representable over a fixed finite field and having bounded tree-width is well-quasi-ordered under taking minors. We also show that for every finite w, a represented infinite matroid has tree-width at most w if and only if all its finite submatroids have tree-width at most w. Both proofs rely on the use of a notion of chordality for represented matroids.
  • Keywords
    Chordality , Tree-decompositions , matroids , Well-quasi-ordering
  • Journal title
    Journal of Combinatorial Theory Series B
  • Serial Year
    2011
  • Journal title
    Journal of Combinatorial Theory Series B
  • Record number

    1528125