## 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 order
✦ LIBER ✦
On chain and antichain families of a partially ordered set
✍ Scribed by András Frank
- Publisher
- Elsevier Science
- Year
- 1980
- Tongue
- English
- Weight
- 547 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The lattice of antichain cutsets of a pa
✍
Gerhard Behrendt
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 125 KB
On partitions of a partially ordered set
✍
A.J Hoffman; D.E Schwartz
📂
Article
📅
1977
🏛
Elsevier Science
🌐
English
⚖ 451 KB
Complete subgraphs of infinite multipart
✍
A. Hajnal; N. Sauer
📂
Article
📅
1986
🏛
Elsevier Science
🌐
English
⚖ 393 KB
A class of matroids derived from saturat
✍
W.A Denig
📂
Article
📅
1981
🏛
Elsevier Science
🌐
English
⚖ 843 KB
Remarks on the cofinality of a partially
✍
E.C. Milner; N. Sauer
📂
Article
📅
1981
🏛
Elsevier Science
🌐
English
⚖ 694 KB
A problem concerning the cardinality of the cofinal subsets of a partially ordered set is reduced to an open problem irr graph tteory. Let A be an in&it: wdinal, V = Ui,, Vi, I Uiii VJC IVJ (i CA). J\_et G be a graph on V with the proper?y that whenever i <A, x=u ie,cA Vi and IXICIVil, then there is
On the family of linear extensions of a
✍
Peter C Fishburn
📂
Article
📅
1974
🏛
Elsevier Science
🌐
English
⚖ 170 KB