Fixed point property for finite ordered sets that contain no crowns with 6 or more elements
From MaRDI portal
Publication:2183104
DOI10.1007/S11083-019-09498-ZzbMATH Open1455.06001OpenAlexW2952684113WikidataQ127735007 ScholiaQ127735007MaRDI QIDQ2183104FDOQ2183104
Authors: Yanyan Li
Publication date: 26 May 2020
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-019-09498-z
Recommendations
Partial orders, general (06A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Title not available (Why is that?)
- A fixed point theorem for finite partially orderes sets
- Fixed point property for 11-element sets
- Dimension two, fixed points and dismantlable ordered sets
- On the fixed point property for \((3 + 1)\)-free ordered sets
- Ordered sets. An introduction with connections from combinatorics to topology
- The complexity of the fixed point property
- The fixed point property in ordered sets of width two
- Forbidden retracts for finite ordered sets of width at most four
- 3-interval irreducible partially ordered sets
- The fixed point property for ordered sets of interval dimension 2
- Performance guarantees and applications for Xia's algorithm
Cited In (1)
This page was built for publication: Fixed point property for finite ordered sets that contain no crowns with 6 or more elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183104)