n-median semilattices
✍ Scribed by Hans-Jürgen Bandelt; Melvin F. Janowitz; Gerasimos C. Meletiou
- Publisher
- Springer Netherlands
- Year
- 1991
- Tongue
- English
- Weight
- 596 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0167-8094
No coin nor oath required. For personal study only.
✦ Synopsis
An n-median semllattice (n 2 3) is a meet-semilattice such that (i) every principal ideal is a distributive lattice and (ii) any n-element set of elements is bounded above whenever each of its (n -I)-element subsets has an upper bound. A 3-median semilattice is thus a median semilattice in the classical sense. In this note we demonstrate how the characteristic features of median semilattices carry over to the more general case of n-median semilattices.
📜 SIMILAR VOLUMES
## Abstract The n‐cube is characterized as a connected regular graph in which for any three vertices __u, v__, and __w__ there is a unique vertex that lies simultaneously on a shortest (__u, v__)‐path, a shortest (__v, w__)‐path, and a shortest (__w, u__)‐path.