On the public citation graph

The poset on connected induced subgraphs of a graph need not be Sperner

https://doi.org/10.1007/bf01111746
0 signed · 15 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/bf01171114openalex-snapshot
Ein Satz �ber Untermengen einer endlichen Menge
inferredcites →https://doi.org/10.1016/0012-365x(76)90111-4openalex-snapshot
Some theorems on graphs and posets
inferredcites →https://doi.org/10.1017/cbo9780511809088openalex-snapshot
Introduction to Lattices and Order
inferredcites →https://doi.org/10.2307/2324336openalex-snapshot
E3281
inferredcites →https://doi.org/10.2307/2325170openalex-snapshot
Combinatorics of Finite 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/s00012-020-0642-0openalex-snapshot
The poset of unlabeled induced subgraphs of a finite graph
inferred← citeshttps://doi.org/10.1007/s11083-007-9064-2openalex-snapshot
Infinitely Many Trees Have Non-Sperner Subtree Poset
inferred← citeshttps://doi.org/10.1016/j.jcta.2017.03.003openalex-snapshot
The poset on connected graphs is Sperner
inferred← citeshttps://doi.org/10.1515/9783110925098.327openalex-snapshot
A characterization of lattice-ordered graphs
inferred← citeshttps://doi.org/10.18500/1816-9791-2013-13-2-2-37-44openalex-snapshot
Models of Multi-criteria Optimization with Quality Criteria
inferred← citeshttps://doi.org/10.18500/1816-9791-2013-13-2-2-44-51openalex-snapshot
The Ordered Set of Connected Parts of a Polygonal Graph
inferred← citeshttps://doi.org/10.18500/1816-9791-2013-13-2-2-51-57openalex-snapshot
Combining De Bruijn Graphs, Overlap Graphs and Microassembly for De Novo Genome Assembly
inferred← citeshttps://doi.org/10.18500/1816-9791-2016-16-2-226-231openalex-snapshot
The Sperner Property for Polygonal Graphs Considered as Partially Ordered Sets
inferred← citeshttps://doi.org/10.37236/3101openalex-snapshot
Greedy Trees, Subtrees and Antichains
inferred← citeshttps://doi.org/10.48550/arxiv.1810.08235openalex-snapshot
On the unimodality of convolutions of sequences of binomial coefficients
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.