On the public citation graph

A minimal cutset of the boolean lattice with almost all members

https://doi.org/10.1007/bf01788687
0 signed · 18 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/bf00396272openalex-snapshot
Finite cutsets and finite antichains
inferredcites →https://doi.org/10.1016/0012-365x(90)90229-bopenalex-snapshot
Sphere coverings of the hypercube with incomparable centers
inferredcites →https://doi.org/10.4153/cjm-1986-031-3openalex-snapshot
Antichains and Finite Sets that Meet all Maximal Chains

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.10011openalex-snapshot
Edge‐cutsets in the directed hypercube
inferred← citeshttps://doi.org/10.1006/jcta.1996.0062openalex-snapshot
Long Symmetric Chains in the Boolean Lattice
inferred← citeshttps://doi.org/10.1006/jcta.2000.3066openalex-snapshot
On the f-vectors of Cutsets in the Boolean Lattice
inferred← citeshttps://doi.org/10.1007/bf00341634openalex-snapshot
Minimum cutsets for an element of a boolean lattice
inferred← citeshttps://doi.org/10.1016/j.aim.2018.03.007openalex-snapshot
Kleitman's conjecture about families of given size minimizing the number of k-chains
inferred← citeshttps://doi.org/10.1016/j.dam.2006.11.018openalex-snapshot
Large convex cones in hypercubes
inferred← citeshttps://doi.org/10.1016/j.disc.2009.01.022openalex-snapshot
Packing and covering k -chain free subsets in Boolean lattices
inferred← citeshttps://doi.org/10.1016/j.endm.2005.07.045openalex-snapshot
Large Convex Cones in Hypercubes
inferred← citeshttps://doi.org/10.1016/j.jcta.2006.03.022openalex-snapshot
Cutsets and anti-chains in linear lattices
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00595-2openalex-snapshot
Kleitman and Combinatorics: A Celebration
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00596-4openalex-snapshot
Kleitman and combinatorics
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00103-9openalex-snapshot
Width and f-vectors of Cutsets in the Truncated Boolean Lattice
inferred← citeshttps://doi.org/10.1017/s144678870000238xopenalex-snapshot
Minimum sized fibres in distributive lattices
inferred← citeshttps://doi.org/10.1023/a:1012287720024openalex-snapshot
Games of Chains and Cutsets in the Boolean Lattice II
inferred← citeshttps://doi.org/10.1590/s0101-74382010000300004openalex-snapshot
Modelagem probabilística de setores de um sistema elétrico
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.