On the public citation graph
Antichain cutsets
0 signed · 26 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/bf00396272openalex-snapshot
Finite cutsets and finite antichains
inferredcites →https://doi.org/10.1016/0012-365x(73)90100-3openalex-snapshot
Graphs indecomposable with respect to the X-join
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.1137/0211023openalex-snapshot
The Recognition of Series Parallel Digraphs
inferredcites →https://doi.org/10.2307/1969503openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.4064/fm-65-2-157-167openalex-snapshot
Maximal chains and antichains
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-94-009-2639-4_1openalex-snapshot
Graphical Data Structures for Ordered Sets
inferred← citeshttps://doi.org/10.1007/978-94-017-0697-1_9openalex-snapshot
Reading, Drawing, and Order
inferred← citeshttps://doi.org/10.1007/bf00341634openalex-snapshot
Minimum cutsets for an element of a boolean lattice
inferred← citeshttps://doi.org/10.1007/bf00346652openalex-snapshot
Setup optimization problems with matroid structure
inferred← citeshttps://doi.org/10.1007/bf00383761openalex-snapshot
Wide posets with fixed height and cutset number
inferred← citeshttps://doi.org/10.1007/bf00582742openalex-snapshot
A companion to Grillet's Theorem on maximal chains and antichains
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/bf02034330openalex-snapshot
Diagrams, orientations, and varieties
inferred← citeshttps://doi.org/10.1007/bf02582991openalex-snapshot
Finite antichain cutsets in posets
inferred← citeshttps://doi.org/10.1007/s11083-012-9248-2openalex-snapshot
Antichain Cutsets of Strongly Connected Posets
inferred← citeshttps://doi.org/10.1007/s11083-015-9370-zopenalex-snapshot
Chain Blockers and Convoluted Catalan Numbers
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90011-2openalex-snapshot
Cutsets of Boolean lattices
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90045-4openalex-snapshot
Inversions, cuts, and orientations
inferred← citeshttps://doi.org/10.1016/0097-3165(87)90029-xopenalex-snapshot
Chains, antichains, and fibres
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90242-gopenalex-snapshot
Search and sweep numbers of finite directed acyclic graphs
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80008-xopenalex-snapshot
Orders with Level Diagrams
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.