๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The lattice of antichain cutsets of a partially ordered set

โœ Scribed by Gerhard Behrendt

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
125 KB
Volume
89
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Behrendt,

G., The lattice of antichain cutsets of a partially ordered set, Discrete Mathematics 89 (1991) 201-202.

Every finite lattice is isomorphic to the lattice of antichain cutsets of a finite partially ordered set whose chains have at most three elements.

A subset A of a partially ordered set (X, C) is called an antichain if any two distinct elements of A are incomparable,

๐Ÿ“œ SIMILAR VOLUMES

Spanning retracts of a partially ordered
Spanning retracts of a partially ordered set
โœ D. Duffus; I. Rival; M. Simonovits ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 639 KB

Two general kinds of subsets of a partially ordered set P are always retracts of P:: (1) every maximal chain of P is a retract; (2) in P, every isometric, spanning subset of length one with no crowns is a retract. It follows that in a partially ordered set P with the fixed point property, every maxi

Extensions of ordered sets having the fi
Extensions of ordered sets having the finite cutset property
โœ John Ginsburg ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 892 KB

Let P be an ordered set. P is said to have the finite cutset property if for every x in P there is a finite set F of elements which are noncomparable to x such that every maximal chain in P meets {x} t.J F. It is well known that this property is equivalent to the space of maximal chains of P being c

A partially ordered set of functionals c
A partially ordered set of functionals corresponding to graphs
โœ Alexander Sidorenko ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 776 KB

For a graph G whose vertices are vl, u2, . . . , v, and where E is the set of edges, we define a functional U,(h)= ss SC . . . frl,$EEh(Xi,Xj) > dPc(x~)dAxJ ... dp(x,), where h is a nonnegative symmetric function of two variables. We consider a binary relation + for graphs with fixed numbers of vert