✦ LIBER ✦

On partitions of a partially ordered set

✍ Scribed by A.J Hoffman; D.E Schwartz

Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 451 KB
Volume: 23
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(77)90052-1

No coin nor oath required. For personal study only.

📜 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

On chain and antichain families of a par

On chain and antichain families of a partially ordered set

✍ András Frank 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Average height in a partially ordered se

Average height in a partially ordered set

✍ P. Winkler 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 457 KB

The average height of an element x in a finite poset P is the expected number of elements below x in a random linear extension of P. We prove a number of theorems about average height, some intuitive and some not, using a recent result of L.A. Shepp. Let P be an arbitrary finite poset having n elem

A class of matroids derived from saturat

A class of matroids derived from saturated chain partitions of partially ordered sets

✍ W.A Denig 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 843 KB

Matroids on Partially Ordered Sets

✍ Marilena Barnabei; Giorgio Nicoletti; Luigi Pezzoli 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 346 KB

## L dimension may be chosen within each of the subspaces L in the set S that are ''in general position.'' For example, in the real projective space of dimension 3, consider a plane , a line r not belonging to , the point P [ r l , and two distinct points Q, R both different from P, lying on the l

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