Lecture 10: Matching Polytopes

The lower bound for the matching polytope is actually the following: if you can write M linear inequalities to define the perfect matching polytope on the complete graph (i.e., so that the resulting polytope is equal to the convex hull of perfect matchings in K_n), then M = 2^{\Omega(n)}.

Since Edmonds’ formulation of the polytope (based on odd-sized cuts) uses M = 2^{O(n)} constraints, we know the pretty much the correct answer. (This is due to this recent paper of Thomas Rothvoss.)

This entry was posted in Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s