Abstract
We prove a min-max result on special partially ordered sets, a conjecture of Andras Frank. As corollaries we deduce Dilworth's theorem and the well-known min-max formula for the minimum size edge cover of a graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have