This survey exhibits various algorithms to decide the question if a given ordered set P has
the fixed point property resp. if P has a fixed point free order-preserving self-map. While a …

S. Hazan and V. Neumann-Lara proved in 1996 that every finite partially ordered set whose
comparability graph is clique null has the fixed point property and they asked whether there …

Unlike the study of the fixed point property (FPP, for brevity) of retractable topological
spaces, the research of the FPP of non-retractable topological spaces remains. The present …

The fixed point property for partial orders has been the object of much attention in the past
twenty years. Recently, M. Roddy ([7]) proved this famous conjecture of Rival (see [6]): the …

The fixed point property for ordered sets Page 1 Arab J Math (2012) 1:529–547 DOI 10.1007/s40065-012-0049-7
RESEARCH ARTICLE Bernd SW Schröder The fixed point property for ordered sets …

Let P, Q be ordered sets and let a∈ P. If P {a is a retract of P and sets P and x∈ P: x> p (or
its dual) have the fixed point property then, for each chain complete set P, P× Q has the fixed …

Call a subset A of an ordered set P retractable to b ε P↠ iff the map that maps A to b and
leaves all other points fixed is a retraction. We prove fixed point theorems for sets that …

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 …

Fixed Points and Products: Width 3 Page 1 Order 19: 319–326, 2002. © 2002 Kluwer Academic
Publishers. Printed in the Netherlands. 319 Fixed Points and Products: Width 3 MICHAEL S …