Covering posets
Let \((X,\leq)\) be an ordered set. A pair \((a,b)\) of elements of \(X\) is a covering pair if \(b\) covers \(a\). The set \(C(X)\) of all covering pairs of \(X\) can be naturally ordered by \((a,b)\leq (c,d)\) iff \((a,b)=(c,d)\) or \(b\leq c\). The poset \((C(X),\leq)\) is called the covering poset of \((X,\leq)\). The paper contains necessary and sufficient conditions for a finite poset to be a covering poset of a finite poset. The author also derives some relations between finite posets with isomorphic covering posets and some relations between dimensions of \((X,\leq)\) and \((C(X),\leq)\).
- Covering a symmetric poset by symmetric chains
- scientific article; zbMATH DE number 6719170 (Why is no real title available?)
- A note on coverings of posets, \(A\)-spaces and polyhedra
- Automorphism groups of covering posets and of dense posets
- The \(m\)-cover posets and their applications
- Covering energy of some classes of posets
- Modular pairs, covering property and related results in posets
- An analogue of covering space theory for ranked posets
- Height of a superposition
This page was built for publication: Covering posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108294)
