Constructing greedy linear extensions by interchanging chains

✍ Scribed by Ivan Rival; Nejib Zaguia

• Publisher: Springer Netherlands
• Year: 1986
• Tongue: English
• Weight: 656 KB
• Volume: 3
• Category: Article
• ISSN: 0167-8094
• DOI: 10.1007/bf00390102

✦ Synopsis

A natural way to prove that a particular linear extension of an ordered set is 'optimal' with respect to the 'jump number' is to transform this linear extension 'canonically' into one that is 'optimal'. We treat a 'greedy chain interchange' transformation which has applications to ordered sets for which each 'greedy' linear extension is 'optimal'.