Covering a symmetric poset by symmetric chains (Q1272179)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Covering a symmetric poset by symmetric chains |
scientific article |
Statements
Covering a symmetric poset by symmetric chains (English)
0 references
23 November 1998
0 references
A min-max result on special partially ordered sets, conjectured by András Frank, is proven. Dilworth's theorem and Gallai's min-max formula for the maximum size edge cover of a graph are deduced as corollaries.
0 references
partially ordered sets
0 references
min-max theorem
0 references
edge cover of a graph
0 references
