Connectivity Properties of Matroids

The bases-exchange graph of a matroid is the graph whose vertices are the bases of the matroid, and two bases are connected by an edge if and only if one can be obtained from the other by the exchange of a single pair of elements. In this paper we prove that a matroid is "connected" if and only if the "restricted bases-exchange graph" (the bases-exchange graph restricted to exchanges involving only one specific element e) is connected. This provides an alternative definition of matroid connectivity. Moreover, it shows that the connected components of the restricted bases-exchange graph satisfy a "ratios-condition", namely, that the ratio of the number of bases containing e to the number of bases not containing e is the same for each connected component of the restricted bases-exchange graph. We further show that if a more general ratios-condition is also true, namely, that any fraction a of the bases containing e is adjacent to at least a fraction a of the bases not containing e (where a is any real number between 0 and 1), then the bases-exchange graph has the following expansion property: "For any bipartition of its vertices, the number of edges incident to both partition classes is at least as large as the size of the smaller parti".

[1]  Mark Jerrum,et al.  Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved , 1988, STOC '88.

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

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

[4]  H. Whitney.  On the Abstract Properties of Linear Dependence , 1935 .

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

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

[7]  Donald M. Topkis,et al.  Adjacency on polymatroids , 1984, Math. Program..

[8]  Milena Mihail,et al.  Conductance and convergence of Markov chains-a combinatorial treatment of expanders , 1989, 30th Annual Symposium on Foundations of Computer Science.

[9]  Andrei Z. Broder,et al.  How hard is it to marry at random? (On the approximation of the permanent) , 1986, STOC '86.

[10]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[11]  Miklós Simonovits,et al.  The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[12]  Mark Jerrum,et al.  Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version) , 1988, STOC 1988.

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

[14]  M. Luby,et al.  Polytopes, permanents and graphs with large factors , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[15]  D. Aldous.  On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing , 1987, Probability in the Engineering and Informational Sciences.

[16]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[17]  F. Harary,et al.  On the Tree Graph of a Matroid , 1972 .

[18]  Andrei Z. Broder,et al.  Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.

[19]  Denis Naddef,et al.  Pancyclic properties of the graph of some 0-1 polyhedra , 1984, J. Comb. Theory, Ser. B.

[20]  William R. Pulleyblank,et al.  Hamiltonicity in (0-1)-polyhedra , 1984, J. Comb. Theory, Ser. B.