Matroids and complexity

We consider different ways of describing a matroid to a Turing machine by listing the members of various families of subsets, and we construct an order on these different methods of description. We show that, under this scheme, several natural matroid problems are complete in classes thought not to be equal to P. We list various results linking parameters of basis graphs to parameters of their associated matroids. For small values of k we determine which matroids have the clique number, chromatic number, or maximum degree of their basis graphs bounded above by k. If P is a class of graphs that is closed under isomorphism and induced subgraphs, then the set of matroids whose basis graphs belong to P is closed under minors. We characterise the minor-closed classes that arise in this way, and exhibit several examples. One way of choosing a basis of a matroid at random is to select a total ordering of the ground set uniformly at random and use the greedy algorithm. We consider the class of matroids having the property that this procedure chooses a basis uniformly at random. Finally we consider a problem mentioned by Oxley. He asked if, for every two elements and n - 2 cocircuits in an n-connected matroid, there is a circuit that contains both elements and that meets every cocircuit. We show that a slightly stronger property holds for regular matroids.

[1]  Frank Harary,et al.  Graph Theory , 2016 .

[2]  D. Lucas,et al.  Weak maps of combinatorial geometries , 1975 .

[3]  G. Dirac.  In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen† , 1960 .

[4]  Dillon Mayhew,et al.  Families of matroids induced by classes of graphs , 2005, Adv. Appl. Math..

[5]  James G. Oxley.  A matroid generalization of a result of Dirac , 1997, Comb..

[6]  Gert Sabidussi,et al.  Graphs with Given Group and Given Graph-Theoretical Properties , 1957, Canadian Journal of Mathematics.

[7]  D. Welsh,et al.  On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.

[8]  D. Hausmann,et al.  Algorithmic versus axiomatic definitions of matroids , 1981 .

[10]  R. Cummins.  Hamilton Circuits in Tree Graphs , 1966 .

[11]  James G. Oxley,et al.  A Note on the Non-spanning Circuits of a Matroid , 1991, Eur. J. Comb..

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Mark Jerrum.  Two Remarks Concerning Balanced Matroids , 2006, Comb..

[14]  Milena Mihail.  On the Expansion of Combinatorial Polytopes , 1992, MFCS.

[15]  James Oxley,et al.  A characterization of a class of non-binary matroids , 1990, J. Comb. Theory, Ser. B.

[16]  Huiling Li.  On Basis-transitive Geometric Lattices , 1989, Eur. J. Comb..

[17]  M. Yannakakis.  The Complexity of the Partial Order Dimension Problem , 1982 .

[18]  D. J. A. Welsh,et al.  On the Number of Combinatorial Geometries , 1971 .

[19]  Manoel Lemos,et al.  A sharp bound on the size of a connected matroid , 2001 .

[20]  Charles J. Colbourn,et al.  The complexity of computing the tutte polynomial on transversal matroids , 1995, Comb..

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

[22]  M. Deza,et al.  Matroid Applications: Perfect Matroid Designs , 1992 .

[23]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[24]  Marc Noy,et al.  On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids , 2006, Combinatorics, Probability and Computing.

[25]  G. Brightwell,et al.  Counting linear extensions , 1991 .

[26]  W. T. Tutte.  Matroids and graphs , 1959 .

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

[28]  Mihalis Yannakakis,et al.  Node-and edge-deletion NP-complete problems , 1978, STOC.

[29]  Tom Brylawski,et al.  An Affine Representation for Transversal Geometries , 1975 .

[30]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[31]  E. L. Lawler.  POLYNOMIAL BOUNDED AND ( APPARENTLY ) NON POLYNOMIAL BOUNDED MATROID COMPUTATIONS , .

[32]  Marc Noy,et al.  On the chromatic number of tree graphs , 2000, Discret. Math..

[33]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, International Workshop on Graph-Theoretic Concepts in Computer Science.

[34]  Tuvi Etzion,et al.  On the Chromatic Number, Colorings, and Codes of the Johnson Graph , 1996, Discret. Appl. Math..

[35]  W. T. Tutte.  A homotopy theorem for matroids. II , 1958 .

[36]  Haidong Wu,et al.  A Generalization of a Theorem of Dirac , 2001, J. Comb. Theory, Ser. B.

[37]  J. Edmonds.  Minimum partition of a matroid into independent subsets , 1965 .

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

[39]  J. D. Donald,et al.  A characterization of complete matroid base graphs , 1977, J. Comb. Theory, Ser. B.

[40]  Annie Astié-Vidal.  Factor group of the automorphism group of a matroid basis graph with respect to the automorphism group of the matroid , 1980, Discret. Math..

[41]  H. Shank,et al.  A Note on Hamilton Circuits in Tree Graphs , 1968 .

[42]  M. D. Tobey,et al.  A Graphical Representation of Matroids , 1973 .

[43]  James G. Oxley,et al.  Matroid theory , 1992 .

[44]  W. Cunningham,et al.  Matroid optimization and algorithms , 1996 .