On the public citation graph
Finite cutsets and finite antichains
0 signed · 25 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.1007/978-0-8176-4842-8_10openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.1007/bf00565650openalex-snapshot
Compactness and subsets of ordered sets that meet all maximal chains
inferredcites →https://doi.org/10.1090/s0002-9947-1984-0735426-5openalex-snapshot
Compact Spaces and Spaces of Maximal Complete Subgraphs
inferredcites →https://doi.org/10.2307/1969503openalex-snapshot
A Decomposition Theorem for 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/978-1-4899-3558-8_4openalex-snapshot
Dilworth’s Decomposition Theorem in the Infinite Case
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_8openalex-snapshot
Parameters of Partial Orders and Graphs: Packing, Covering, and Representation
inferred← citeshttps://doi.org/10.1007/bf00333129openalex-snapshot
The length, the width and the cutset-number of finite ordered sets
inferred← citeshttps://doi.org/10.1007/bf00341634openalex-snapshot
Minimum cutsets for an element of a boolean lattice
inferred← citeshttps://doi.org/10.1007/bf00383761openalex-snapshot
Wide posets with fixed height and cutset number
inferred← citeshttps://doi.org/10.1007/bf00385815openalex-snapshot
Infinite ordered sets spanned by finitely many chains
inferred← citeshttps://doi.org/10.1007/bf00400289openalex-snapshot
Cores, cutsets and the fixed point property
inferred← citeshttps://doi.org/10.1007/bf00565650openalex-snapshot
Compactness and subsets of ordered sets that meet all maximal chains
inferred← citeshttps://doi.org/10.1007/bf01108707openalex-snapshot
On the dimension of ordered sets with the 2-cutset property
inferred← citeshttps://doi.org/10.1007/bf01788687openalex-snapshot
A minimal cutset of the boolean lattice with almost all members
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90157-3openalex-snapshot
Extensions of ordered sets having the finite cutset property
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90011-2openalex-snapshot
Cutsets of Boolean lattices
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90328-qopenalex-snapshot
Cut-sets in infinite graphs and partial orders
inferred← citeshttps://doi.org/10.1016/0095-8956(89)90044-0openalex-snapshot
A length-width inequality for partially ordered sets with two-element cutsets
inferred← citeshttps://doi.org/10.1016/0097-3165(87)90029-xopenalex-snapshot
Chains, antichains, and fibres
inferred← citeshttps://doi.org/10.1016/0097-3165(88)90075-1openalex-snapshot
A chain decomposition theorem
inferred← citeshttps://doi.org/10.4153/cmb-1991-004-1openalex-snapshot
Binary Trees and the n-Cutset Property
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.