On the Expansion of Graphs of 0/1-Polytopes

Details On the Expansion of Graphs of 0/1-Polytopes On the Expansion of Graphs of 0/1-Polytopes

2001-12-14

arxiv.org/abs/math/0112146v1

Mathematics

Combinatorics

19 pages

Scientific paper

The edge expansion of a graph is the minimum quotient of the number of edges in a cut and the size of the smaller one among the two node sets separated by the cut. Bounding the edge expansion from below is important for bounding the ``mixing time'' of a random walk on the graph from above. It has been conjectured by Mihail and Vazirani that the graph of every 0/1-polytope has edge expansion at least one. A proof of this (or even a weaker) conjecture would imply solutions of several long-standing open problems in the theory of randomized approximate counting. We present different techniques for bounding the edge expansion of a 0/1-polytope from below. By means of these tools we show that several classes of 0/1-polytopes indeed have graphs with edge expansion at least one. These classes include all 0/1-polytopes of dimension at most five, all simple 0/1-polytopes, all hypersimplices, all stable set polytopes, and all (perfect) matching polytopes.

Affiliated with

Also associated with

No associations

Rating

On the Expansion of Graphs of 0/1-Polytopes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Expansion of Graphs of 0/1-Polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Expansion of Graphs of 0/1-Polytopes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-663554