Home ยป The Berge-Fulkerson conjecture

I believe this is best known

On February 25th, 2009 mdevos says:

The $ log(n) $ bound you mention (a consequence of Edmond's perfect matching polytope theorem) is, to my knowledge, the best known lower bound.

Reply

Comments are limited to a maximum of 1000 characters.
More information about formatting options