On the public citation graph
Holes in ordered sets
0 signed · 33 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.3190030404openalex-snapshot
Fixed‐edge theorem for graphs with loops
inferredcites →https://doi.org/10.1007/bf01182246openalex-snapshot
The strong selection property and ordered sets of finite length
inferredcites →https://doi.org/10.1007/bf01203367openalex-snapshot
Every countable lattice is a retract of a direct product of chains
inferredcites →https://doi.org/10.1016/0012-365x(81)90201-6openalex-snapshot
A structure theory for ordered sets
inferredcites →https://doi.org/10.1016/0012-365x(81)90209-0openalex-snapshot
The smallest order variety containing all chains
inferredcites →https://doi.org/10.1016/0012-365x(83)90159-0openalex-snapshot
The smallest graph variety containing all paths
inferredcites →https://doi.org/10.1016/0012-365x(85)90140-2openalex-snapshot
Order varieties generated by ∨-semilattices of finite width
inferredcites →https://doi.org/10.1016/0097-3165(83)90006-7openalex-snapshot
An application of the Helly property to the partially ordered sets
inferredcites →https://doi.org/10.1016/s0304-0208(08)73816-7openalex-snapshot
Representing Ordered Sets by Chains
inferredcites →https://doi.org/10.1090/s0002-9947-1966-0195042-2openalex-snapshot
Finite Topological Spaces
inferredcites →https://doi.org/10.4153/cjm-1987-025-1openalex-snapshot
Absolute Retracts and Varieties of Reflexive Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_19openalex-snapshot
Efficient type reconstruction in the presence of inheritance
inferred← citeshttps://doi.org/10.1007/978-3-662-21963-8_13openalex-snapshot
A Logical Approach to Complexity Bounds for Subtype Inequalities
inferred← citeshttps://doi.org/10.1007/bf00341639openalex-snapshot
Algebraic properties of crowns and fences
inferred← citeshttps://doi.org/10.1007/bf00418652openalex-snapshot
Clones, order varieties, near unanimity functions and holes
inferred← citeshttps://doi.org/10.1007/bf00571184openalex-snapshot
Order varieties generated by finite posets
inferred← citeshttps://doi.org/10.1007/bf01190934openalex-snapshot
Monotone J�nsson operations and near unanimity functions
inferred← citeshttps://doi.org/10.1007/s00012-008-2125-6openalex-snapshot
Retracts of posets: the chain-gap property and the selection property are independent
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90016-7openalex-snapshot
Products of absolute retracts
inferred← citeshttps://doi.org/10.1016/j.disc.2006.08.010openalex-snapshot
Retractions onto series-parallel posets
inferred← citeshttps://doi.org/10.1016/j.disc.2009.08.013openalex-snapshot
Absolute retracts and varieties generated by chordal graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00134-0openalex-snapshot
Some complexity bounds for subtype inequalities
inferred← citeshttps://doi.org/10.1017/9781316716939.015openalex-snapshot
How to characterize provably total functions
inferred← citeshttps://doi.org/10.1017/s0004972700012284openalex-snapshot
Posets, near unanimity functions and zigzags
inferred← citeshttps://doi.org/10.1017/s0004972700018104openalex-snapshot
Monotone clones, residual smallness and congruence distributivity
inferred← citeshttps://doi.org/10.1023/b:orde.0000026602.94442.32openalex-snapshot
Obituary: Ivan Rival
inferred← citeshttps://doi.org/10.1137/16m110527xopenalex-snapshot
NU Polymorphisms on Reflexive Digraphs
inferred← citeshttps://doi.org/10.3233/fi-1996-281211openalex-snapshot
Satisfiability of Inequalities in a Poset
inferred← citeshttps://doi.org/10.48550/arxiv.2002.03019openalex-snapshot
Generalized metric spaces. Relations with graphs, ordered sets and automata : A survey
inferred← citeshttps://doi.org/10.48550/arxiv.2004.05139openalex-snapshot
Preservation of discrete structures. A metric point of view
inferred← citeshttps://doi.org/10.48550/arxiv.math/0612458openalex-snapshot
Retracts of Posets: The Chain_gap Property and the Selection Property are Independant
inferred← citeshttps://doi.org/10.6100/ir570482openalex-snapshot
A Markovian approach to the mathematical control of NPD projects
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.