Minor-closed classes of binary functions

被引:0
|
作者
Jones, Benjamin R. [1 ]
机构
[1] Monash Univ, Fac Informat Technol, Melbourne, Australia
关键词
rank function; binary function; matroid; polymatroid; binary matroid; minor; excluded minor characteri- sation;
D O I
10.46298/dmtcs.12230
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Binary functions are a generalisation of the cocircuit spaces of binary matroids to arbitrary functions. Every rank function is assigned a binary function, and the deletion and contraction operations of binary functions generalise matroid deletion and contraction. We give excluded minor characterisations for the classes of binary functions with well defined minors, and those with an associated rank function. Within these classes, we also characterise the classes of binary functions corresponding to matroids, binary matroids and polymatroids by their excluded minors. This gives a new proof of Tutte's excluded minor characterisation of binary matroids in the more generalised space of binary functions.
引用
收藏
页数:15
相关论文
共 50 条
  • [21] Asymptotic Properties of Some Minor-Closed Classes of Graphs
    Bousquet-Melou, Mireille
    Weller, Kerstin
    COMBINATORICS PROBABILITY & COMPUTING, 2014, 23 (05): : 749 - 795
  • [22] Reconfiguring Dominating Sets in Minor-Closed Graph Classes
    Dieter Rautenbach
    Johannes Redl
    Graphs and Combinatorics, 2021, 37 : 2191 - 2205
  • [23] On minor-closed classes of matroids with exponential growth rate
    Geelen, Jim
    Nelson, Peter
    ADVANCES IN APPLIED MATHEMATICS, 2013, 50 (01) : 142 - 154
  • [24] 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
  • [25] 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
  • [26] THE MATROID SECRETARY PROBLEM FOR MINOR-CLOSED CLASSES AND RANDOM MATROIDS
    Huynh, Tony
    Nelson, Peter
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (01) : 163 - 176
  • [27] THE DENSEST MATROIDS IN MINOR-CLOSED CLASSES WITH EXPONENTIAL GROWTH RATE
    Geelen, Jim
    Nelson, Peter
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2017, 369 (09) : 6751 - 6776
  • [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