About posets of height one as retracts
Author:
Preprint
Abstract
We investigate connected posets $C$ of height one as retracts of finite posets $P$. We define two multigraphs: a multigraph $\mathfrak{F}(P)$ reflecting the network of so-called improper 4-crown bundles contained in the extremal points of $P$, and a multigraph $\mathfrak{C}(C)$ depending on $C$ but not on $P$. There exists a close interdependence between $C$ being a retract of $P$ and the existence of a graph homomorphism of a certain type from $\mathfrak{F}(P)$ to $\mathfrak{C}(C)$. In particular, if $C$ is an ordinal sum of two antichains, then $C$ is a retract of $P$ iff such a graph homomorphism exists. Returning to general connected posets $C$ of height one, we show that the image of such a graph homomorphism can be a clique in $\mathfrak{C}(C)$ iff the improper 4-crowns in $P$ contain only a sparse subset of the edges of $C$.
Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- The Fixed Point Property in the Set of All Order Relations on a Finite SetOrder, 2021
- The fixed point property for ordered setsArabian Journal of Mathematics, 2012
- Order Extensions and the Fixed Point PropertyOrder, 2008
- Fixed point theorems for ordered sets P with P ? {a, c} as retractOrder, 1996
- On retractable sets and the fixed point propertyAlgebra universalis, 1995
- Retractability and the fixed point property for productsOrder, 1994
- Fixed point property for 11-element setsOrder, 1993
- The fixed point property for small setsOrder, 1989
- Cores, cutsets and the fixed point propertyOrder, 1986
- Fixed‐edge theorem for graphs with loopsJournal of Graph Theory, 1979