The structure of k-CS-transitive cycle-free partial orders
Author(s)
Bibliographic Information
The structure of k-CS-transitive cycle-free partial orders
（Memoirs of the American Mathematical Society, no. 614）
American Mathematical Society, 1997
Available at / 18 libraries
-
No Libraries matched.
- Remove all filters.
Note
"September 1997, volume 129, number 614 (second of 4 numbers)"
Includes bibliographical references (p. 165-166)
Description and Table of Contents
Description
In this work, the class of cycle-free partial orders (CFPOs) is defined, and the CFPOs fulfilling a natural transitivity assumption, called $k$-connected set transitivity ($k$-$CS$-transitivity), are analyzed in some detail. Classification in many of the interesting cases is given. This work generalizes Droste's classification of the countable $k$-transitive trees ($k \geq 2$). In a CFPO, the structure can branch downwards as well as upwards, and can do so repeatedly (though it never returns to the starting point by a cycle). Mostly it is assumed that $k \geq 3$ and that all maximal chains are finite. The main classification splits into the sporadic and skeletal cases. The former is complete in all cardinalities.The latter is performed only in the countable case. The classification is considerably more complicated than for trees, and skeletal CFPOs exhibit rich, elaborate and rather surprising behavior. It's features include: lucid exposition of an important generalization of Droste's work; extended introduction clearly explaining the scope of the memoir; visually attractive topic with copious illustrations; and, self-contained material, requiring few prerequisites.
Table of Contents
Extended introduction Preliminaries Properties of $k$-$CS$-transitive CFPOs Constructing CFPOs Characteization and isomorphism theorems Classification of skeletal CFPOs (Part 1) Classification of skeletal CFPOs (Part 2) Sporadic cycle-free partial orders.
by "Nielsen BookData"
