On the public citation graph

Dimension two, fixed points and dismantlable ordered sets

0 signed · 23 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-94-009-7798-3_5openalex-snapshot
Dimension Theory for Ordered Sets
inferredcites →https://doi.org/10.1007/bf00337690openalex-snapshot
The fixed point property in ordered sets of width two
inferredcites →https://doi.org/10.1007/bf00341631openalex-snapshot
The fixed point property for small sets
inferredcites →https://doi.org/10.1007/bf00571182openalex-snapshot
On the number of nondismantlable posets with the fixed point property
inferredcites →https://doi.org/10.1007/bf01108589openalex-snapshot
The endomorphism spectrum of an ordered set
inferredcites →https://doi.org/10.1007/bf01111296openalex-snapshot
The uniqueness of the core
inferredcites →https://doi.org/10.1016/0001-8708(79)90045-8openalex-snapshot
Fixed points in partially ordered sets
inferredcites →https://doi.org/10.1016/0012-365x(79)90013-xopenalex-snapshot
On a fixed point theorem for partially ordered sets
inferredcites →https://doi.org/10.1016/0012-365x(80)90093-xopenalex-snapshot
Spanning retracts of a partially ordered set
inferredcites →https://doi.org/10.1016/0097-3165(76)90003-0openalex-snapshot
A fixed point theorem for finite partially ordered sets

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/bf00338740openalex-snapshot
The complexity of the fixed point property
inferred← citeshttps://doi.org/10.1007/s11083-010-9185-xopenalex-snapshot
On the Fixed Point Property for (3 + 1)-Free Ordered Sets
inferred← citeshttps://doi.org/10.1007/s11083-016-9401-4openalex-snapshot
The Fixed Point Property for Ordered Sets of Interval Dimension 2
inferred← citeshttps://doi.org/10.1007/s11083-019-09498-zopenalex-snapshot
Fixed Point Property for Finite Ordered Sets that Contain No Crowns with 6 or More Elements
inferred← citeshttps://doi.org/10.1007/s40065-012-0049-7openalex-snapshot
The fixed point property for ordered sets
inferred← citeshttps://doi.org/10.1007/s40065-022-00399-5openalex-snapshot
Minimal automorphic superpositions of crowns
inferred← citeshttps://doi.org/10.1016/b978-0-12-804295-3.50008-5openalex-snapshot
The Use of Retractions in the Fixed Point Theory for Ordered Sets
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.024openalex-snapshot
Forbidden retracts for finite ordered sets of width at most four
inferred← citeshttps://doi.org/10.1016/j.jcta.2021.105562openalex-snapshot
Fixed points of group actions on link collapsible simplicial complexes
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00273-4openalex-snapshot
Algorithms for the fixed point property
inferred← citeshttps://doi.org/10.1023/a:1006029802751openalex-snapshot
The Fixed Point Property for Posets of Small Width
inferred← citeshttps://doi.org/10.1023/a:1022424931030openalex-snapshot
Linear extensions of orderings
inferred← citeshttps://doi.org/10.1023/b:orde.0000026602.94442.32openalex-snapshot
Obituary: Ivan Rival
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.