Paper Info
Title
Covering A Symmetric Poset By Symmetric Chains
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.
Year
DOI
Venue
1997
10.1007/BF01215916
COMBINATORICA
Keywords
DocType
Volume
partially ordered set
Journal
17
Issue
ISSN
Citations 
3
0209-9683
3
PageRank 
References 
Authors
0.50
0
1
Name
Order
Citations
PageRank
Tamás Fleiner124127.45