کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4657018 1343708 2011 18 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Linked tree-decompositions of represented infinite matroids
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Linked tree-decompositions of represented infinite matroids
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Combinatorial Theory, Series B - Volume 101, Issue 3, May 2011, Pages 123-140