The complexity of the fixed point property

DOI10.1007/BF00389835zbMath0866.06002OpenAlexW2036324185MaRDI QIDQ1354627

O. Diekmann

Publication date: 26 June 1997

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00389835

zbMATH Keywords

NP-completenessfixed point propertyorder-preserving self-map

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06)

Related Items

The fixed point property for ordered sets of interval dimension 2 ⋮ The fixed point property for ordered sets ⋮ Fixed point property for finite ordered sets that contain no crowns with 6 or more elements ⋮ The fixed vertex property for graphs ⋮ Minimal automorphic superpositions of crowns ⋮ Forbidden retracts for finite ordered sets of width at most four ⋮ Isotone relations revisited ⋮ Algorithms for the fixed point property

Cites Work

• Unnamed Item
• Two-colouring all two-element maximal antichains
• Fibres and ordered set coloring
• Coloring Ordered Sets to Avoid Monochromatic Maximal Chains