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
The order-interval hypergraph of a finite poset and the König property
✍ Scribed by Isma Bouchemakh; Konrad Engel
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 561 KB
- Volume
- 170
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
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 covering number r, the matching number v and the edge covering number p are NP-complete. For interval orders we describe polynomial algorithms and prove the K6nig property (v = 3) and the dual K6nig property (~ = p). Finally we show that the (dual) K6nig property is preserved by product.
📜 SIMILAR VOLUMES
We investigate the topological properties of the poset of proper cosets xH in a finite group G. Of particular interest is the reduced Euler characteristic, which is closely related to the value at -1 of the probabilistic zeta function of G. Our main result gives divisibility properties of this reduc
In the hyperspace Exp X of all closed subsets of a topological space X interval and order topology solely use the c-relation in Exp X for their definitions whereas HAUSDORFB set convergence and VIETORIS topology use neighbourhoods in X itself. Nevertheless there exist intimate but non-trivial relati