Covering a symmetric poset by symmetric chains

We prove a min-max result on special partially ordered sets, a conjecture of András Frank. As corollaries we deduce Dilworth's theorem and the well-known min-max formula for the minimum size edge cover of a graph.Research supported by the Netherlands Organization for Scientific Research (NWO)