Remarks on the cofinality of a partially ordered set, and a generalization of König's lemma
✍ Scribed by E.C. Milner; N. Sauer
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 694 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
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 a set Y c Vi such that IY1 = IVj and Y XX eE(G).
The question is whether such a gaph contains a complete subgraph of cardinality A? We :?iqve an extension of Kikig's infinitary lemma which shows that the above graph contains a "PL?: of cardinal A.
📜 SIMILAR VOLUMES
We study the hypergraph ~(P) whose vertices are the points of a finite poset and whose edges are the maximal intervals in P (i.e. sets of the form I = {v ~ P:p <~ v <<. q}, p minimal, q maximal). We mention resp. show that the problems of the determination of the independence number c~, the point co
## Abstract Preordered topological spaces for which the order has a closed graph form a topological category. Within this category we identify the MacNeille completions (coinciding with the universal initial completions) of five monotopological subcategories, namely those of the __T__~0~(__T__~1~,
A generalization of Blaschke's Rolling Theorem for not necessarily convex sets is proved that exhibits an intimate connection between a generalized notion of convexity, various concepts in mathematical morphology and image processing, and a certain smoothness condition. As a consequence a geometric