On the excluded minors for the matroids of branch-width k

被引：28
|
作者：
Geelen, JF [1 ]
Gerards, AMH
Robertson, N
Whittle, GP
机构：
[1] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
[2] CWI, NL-1090 GB Amsterdam, Netherlands
[3] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
[4] Ohio State Univ, Dept Math, Columbus, OH 43210 USA
[5] Univ Victoria, Sch Math & Comp Sci, Wellington, New Zealand
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 2003年 / 88卷 / 02期
关键词：
branch-width; matroids; connectivity; excluded minors;
D O I：
10.1016/S0095-8956(02)00046-1
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We prove that the excluded minors for the class of matroids of branch-width k have size at most (6(k) - 1)/5. (C) 2002 Elsevier Science (USA). All rights reserved.
引用
收藏
页码：261 / 265
页数：5
相关论文
共 50 条
  • [41] APPROXIMATING WIDTH PARAMETERS OF HYPERGRAPHS WITH EXCLUDED MINORS
    Fomin, Fedor V.
    Golovach, Petr A.
    Thilikos, Dimitrios M.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (03) : 1331 - 1348
  • [42] Excluded vertex-minors for graphs of linear rank-width at most k
    Jeong, Jisu
    Kwon, O-joung
    Oum, Sang-il
    EUROPEAN JOURNAL OF COMBINATORICS, 2014, 41 : 242 - 257
  • [43] Computing excluded minors for classes of matroids representable over partial fields
    Brettell, Nick
    Pendavingh, Rudi
    ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (03):
  • [44] Minor-Minimal Planar Graphs of Even Branch-Width
    Inkmann, Torsten
    Thomas, Robin
    COMBINATORICS PROBABILITY & COMPUTING, 2011, 20 (01): : 73 - 82
  • [45] The excluded 3-minors for vf-safe delta-matroids
    Bonin, Joseph E.
    Chun, Carolyn
    Noble, Steven D.
    ADVANCES IN APPLIED MATHEMATICS, 2021, 126 (126)
  • [46] THE 9-CONNECTED EXCLUDED MINORS FOR THE CLASS OF QUASI-GRAPHIC MATROIDS
    Chen, Rong
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (03) : 1627 - 1644
  • [47] Local Tree-Width, Excluded Minors, and Approximation Algorithms
    Martin Grohe
    Combinatorica, 2003, 23 : 613 - 632
  • [48] Local tree-width, excluded minors, and approximation algorithms
    Grohe, M
    COMBINATORICA, 2003, 23 (04) : 613 - 632
  • [49] Dominating sets in planar graphs: Branch-width and exponential speed-up
    Fomin, FV
    Thilikos, DM
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 168 - 177
  • [50] Dominating sets in planar graphs: Branch-width and exponential speed-up
    Fomin, Fedor V.
    Thilikos, Dimitrios M.
    SIAM JOURNAL ON COMPUTING, 2006, 36 (02) : 281 - 309
12345