On the Efficiency of Representability Tests for Matroids

An efficient algorithm is described for testing regularity of a matroid (i.e., representability over every field). Furthermore it is shown that a number of other matroid representability questions cannot be decided efficiently. In each case it is assumed that the matroid in question is specified by an independence oracle.

[1]  Klaus Truemper,et al.  Alpha-balanced graphs and matrices and GF(3)-representability of matroids , 1982, J. Comb. Theory, Ser. B.

[2]  Robert E. Bixby,et al.  Converting Linear Programs to Network Problems , 1980, Math. Oper. Res..

[3]  Paul D. Seymour,et al.  Decomposition of regular matroids , 1980, J. Comb. Theory, Ser. B.

[4]  W. T. Tutte.  An algorithm for determining whether a given binary matroid is graphic. , 1960 .

[5]  Stein Krogdahl.  The dependence graph for bases in matroids , 1977, Discret. Math..

[6]  L. Weinberg,et al.  GRAPH‐REALIZABILITY OF MATROIDS , 1979 .

[7]  Paul D. Seymour,et al.  Recognizing graphic matroids , 1981 .

[8]  Paul Seymour,et al.  Detecting Matroid Minors , 1981 .

[9]  W. T. Tutte.  Lectures on matroids , 1965 .

[10]  D. Welsh,et al.  The computational complexity of matroid properties , 1980, Mathematical Proceedings of the Cambridge Philosophical Society.

[11]  J. Edmonds,et al.  A Combinatorial Decomposition Theory , 1980, Canadian Journal of Mathematics.

[12]  Satoru Fujishige,et al.  An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem , 1980, J. Comput. Syst. Sci..