On trees and tree dimension of ordered sets |
| |
Authors: | Gerhard Behrendt |
| |
Affiliation: | (1) Mathematisches Institut, Universität Tübingen, Auf der Morgenstelle 10, D-72076 Tübingen, Germany |
| |
Abstract: | We call an ordered set (X, ) a tree if no pair of incomparable elements ofX has an upper bound. It is shown that there is a natural way to associate a tree (T, ) with any ordered set (X, ), and (T, ) can be characterized by a universal property. We define the tree dimensiontd(X, ) of an ordered set as the minimal number of extensions of (X, ) which are trees such that the given order is the intersection of those tree orders. We give characterizations of the tree dimension, relations between dimension and tree dimension, and removal theorems. |
| |
Keywords: | 06A06 |
本文献已被 SpringerLink 等数据库收录! |
|