On the public citation graph

Dilworth’s covering theorem for modular lattices: A simple proof

https://doi.org/10.1007/bf02945140
0 signed · 13 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/978-1-4899-3558-8_21openalex-snapshot
Proof of a Conjecture on Finite Modular Lattices
inferredcites →https://doi.org/10.1007/978-3-642-62012-6openalex-snapshot
Finite Geometries
inferredcites →https://doi.org/10.2307/1969639openalex-snapshot
Proof of a Conjecture on Finite Modular Lattices

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_25openalex-snapshot
Dilworth’s Covering Theorem for Modular Lattices
inferred← citeshttps://doi.org/10.1007/bf00383603openalex-snapshot
Counting formulas for glued lattices
inferred← citeshttps://doi.org/10.1007/bf00582747openalex-snapshot
Unsolved problems
inferred← citeshttps://doi.org/10.1007/bf01190913openalex-snapshot
Subdiagrams equal in number to their duals
inferred← citeshttps://doi.org/10.1007/bf02485273openalex-snapshot
An arithmetical theorem for modular lattices
inferred← citeshttps://doi.org/10.1007/bf02485838openalex-snapshot
Combinatorial inequalities for semimodular lattices of breadth two
inferred← citeshttps://doi.org/10.1016/0097-3165(82)90047-4openalex-snapshot
Matching in modular lattices
inferred← citeshttps://doi.org/10.1016/s0079-8169(08)61359-8openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/s0305004100066573openalex-snapshot
Matchings and Radon transforms in lattices II. Concordant sets
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.