A fixed point theorem for finite partially orderes sets
From MaRDI portal
Publication:1237994
DOI10.1016/0097-3165(76)90003-0zbMath0357.06003OpenAlexW2072553879MaRDI QIDQ1237994
Publication date: 1976
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(76)90003-0
Partial orders, general (06A06) Complete lattices, completions (06B23) Directed graphs (digraphs), tournaments (05C20)
Related Items (56)
On incidence algebras and their representations ⋮ Asymptotic fixed point theorem for infinite partially ordered sets ⋮ Dismantlable graphs and posets, fixed clique property ⋮ On linear extensions of ordered sets with a symmetry ⋮ Cores and retracts ⋮ Fixed points and products ⋮ On some topological realizations of groups and homomorphisms ⋮ Quotients of Incidence Algebras and the Euler Characteristic ⋮ De Morgan algebras are universal ⋮ A retract characterization of posets with the fixed-point property ⋮ Fixed points of products and the strong fixed point property ⋮ The fixed point property in the set of all order relations on a finite set ⋮ The fixed point property for ordered sets of interval dimension 2 ⋮ The fixed point property for ordered sets ⋮ Proper Lie automorphisms of incidence algebras ⋮ Fixed point property for finite ordered sets that contain no crowns with 6 or more elements ⋮ Homotopies and the universal fixed point property ⋮ The fixed vertex property for graphs ⋮ Iterated Clique Graphs and Contractibility ⋮ Minimal automorphic superpositions of crowns ⋮ Smallest weakly contractible non-contractible topological spaces ⋮ Spanning retracts of a partially ordered set ⋮ A structure theory for ordered sets ⋮ Algebraic properties of crowns and fences ⋮ Homotopy type and Euler characteristic of partially ordered sets ⋮ Reflexive digraphs with near unanimity polymorphisms ⋮ Foldings in graphs and relations with simplicial complexes and posets ⋮ On the fixed point property for \((3 + 1)\)-free ordered sets ⋮ The fixed point and the common fixed point properties in finite pseudo-ordered sets ⋮ Contractibility and the clique graph operator ⋮ Fixed points in partially ordered sets ⋮ Forbidden retracts for finite ordered sets of width at most four ⋮ Order extensions and the fixed point property ⋮ On the number of nondismantlable posets with the fixed point property ⋮ An extension of a fixed point problem for simple graphs ⋮ A property of projective ordered sets ⋮ Posets Dismantlable by Doubly Irreducibles ⋮ The Möbius function of factor order ⋮ Fixed point property and formal concept analysis ⋮ Isotone relations revisited ⋮ Fixed-edge theorem for graphs with loops ⋮ On a fixed point theorem for partially ordered sets ⋮ The fixed point property for small sets ⋮ Fixed point theorems for ordered sets \(P\) with \(P\setminus \{a, c\}\) as retract ⋮ Fixed points of group actions on link collapsible simplicial complexes ⋮ Obituary: Ivan Rival ⋮ Clique divergent clockwork graphs and partial orders ⋮ Algorithms for the fixed point property ⋮ Simplicial simple-homotopy of flag complexes in terms of graphs ⋮ On retractable sets and the fixed point property ⋮ An application of the Helly property to the partially ordered sets ⋮ Isotone relations and the fixed point property for posets ⋮ On the Helly property working as a compactness criterion on graphs ⋮ Reflexive domains and fixed points ⋮ Fixed point property for 11-element sets ⋮ Ordonnés escamotables et points fixes. (Dismantlable orders and fixed points)
Cites Work
This page was built for publication: A fixed point theorem for finite partially orderes sets
