The Highly Connected Matroids in Minor-Closed Classes

被引：21
|
作者：
Geelen, Jim [1 ]
Gerards, Bert [2 ]
Whittle, Geoff [3 ]
机构：
[1] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
[2] Ctr Wiskunde & Informat, Amsterdam, Netherlands
[3] Victoria Univ Wellington, Sch Math & Comp Sci, Wellington, New Zealand
来源：
ANNALS OF COMBINATORICS | 2015年 / 19卷 / 01期
关键词：
matroids; minors; connectivity; girth; linear codes; ML threshold function; growth rate; COMBINATORIAL GEOMETRIES; DECOMPOSITION; GF(3); GF(Q);
D O I：
10.1007/s00026-015-0251-3
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the structural characterization.
引用
收藏
页码：107 / 123
页数：17
相关论文
共 50 条
  • [21] Reconfiguring Dominating Sets in Minor-Closed Graph Classes
    Rautenbach, Dieter
    Redl, Johannes
    GRAPHS AND COMBINATORICS, 2021, 37 (06) : 2191 - 2205
  • [22] Layered separators in minor-closed graph classes with applications
    Dujmovic, Vida
    Morin, Pat
    Wood, David R.
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 127 : 111 - 147
  • [23] MINOR-CLOSED GRAPH CLASSES WITH BOUNDED LAYERED PATHWIDTH
    Dujmovic, Vida
    Eppstein, David
    Joret, Gwenael
    Morin, Pat
    Wood, David R.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (03) : 1693 - 1709
  • [24] Asymptotic Properties of Some Minor-Closed Classes of Graphs
    Bousquet-Melou, Mireille
    Weller, Kerstin
    COMBINATORICS PROBABILITY & COMPUTING, 2014, 23 (05): : 749 - 795
  • [25] Reconfiguring Dominating Sets in Minor-Closed Graph Classes
    Dieter Rautenbach
    Johannes Redl
    Graphs and Combinatorics, 2021, 37 : 2191 - 2205
  • [26] On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes
    Nelson, Peter
    van Zwam, Stefan H. M.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (03) : 1153 - 1158
  • [27] Minimum spanning trees for minor-closed graph classes in parallel
    Gustedt, J
    STACS 98 - 15TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1998, 1373 : 421 - 431
  • [28] Long induced paths in minor-closed graph classes and beyond
    Hilaire, Claire
    Raymond, Jean-Florent
    ELECTRONIC JOURNAL OF COMBINATORICS, 2023, 30 (01): : 1 - 26
  • [29] A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
    Tazari, Siamak
    Mueller-Hannemann, Matthias
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2008, 5344 : 360 - +
  • [30] Strengthening Erdos-Posa Property for Minor-Closed Graph Classes
    Fomin, Fedor V.
    Saurabh, Saket
    Thilikos, Dimitrios M.
    JOURNAL OF GRAPH THEORY, 2011, 66 (03) : 235 - 240
12345