Covering a symmetric poset by symmetric chains (Q1272179)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Covering a symmetric poset by symmetric chains |
scientific article; zbMATH DE number 1226324
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Covering a symmetric poset by symmetric chains |
scientific article; zbMATH DE number 1226324 |
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
0.8855755
0 references
0 references
0.8726395
0 references
0 references
0.86646956
0 references
0 references
0.85860455
0 references
0.8557081
0 references
