On the public citation graph

Combinatorial inequalities for semimodular lattices of breadth two

https://doi.org/10.1007/bf02485838
0 signed · 35 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.1002/malq.19560020803openalex-snapshot
Hüllensysteme und Erweiterung von Quasi‐Ordnungen
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/978-1-4899-3558-8_21openalex-snapshot
Proof of a Conjecture on Finite Modular Lattices
inferredcites →https://doi.org/10.1007/bf01350778openalex-snapshot
Über eine Eigenschaft der Dedekind-MacNeilleschen Hülle
inferredcites →https://doi.org/10.1007/bf01900297openalex-snapshot
Zur Kennzeichnung der Dedekind-MacNeilleschen HÜlle einer geordneten HÜlle
inferredcites →https://doi.org/10.1007/bf02485832openalex-snapshot
On the width of sets of irreducibles in finite modular lattices
inferredcites →https://doi.org/10.1007/bf02945140openalex-snapshot
Dilworth’s covering theorem for modular lattices: A simple proof
inferredcites →https://doi.org/10.1016/s0021-9800(70)80090-4openalex-snapshot
A rank inequality for finite geometric lattices
inferredcites →https://doi.org/10.1017/s0305004100043243openalex-snapshot
A characterization of sets of n points which determine n hyperplanes
inferredcites →https://doi.org/10.1090/s0002-9947-1937-1501929-xopenalex-snapshot
Partially Ordered Sets
inferredcites →https://doi.org/10.1215/s0012-7094-74-04126-xopenalex-snapshot
Sublattices generated by chains in modular topological lattices
inferredcites →https://doi.org/10.2307/1969503openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.2307/1969639openalex-snapshot
Proof of a Conjecture on Finite Modular Lattices
inferredcites →https://doi.org/10.4153/cjm-1974-120-2openalex-snapshot
Crowns, Fences, and Dismantlable Lattices
inferredcites →https://doi.org/10.4153/cjm-1975-074-0openalex-snapshot
Planar Lattices
inferredcites →https://doi.org/10.4153/cmb-1974-016-3openalex-snapshot
Lattices with Doubly Irreducible Elements

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/978-94-009-7798-3_5openalex-snapshot
Dimension Theory for Ordered Sets
inferred← citeshttps://doi.org/10.1007/978-94-011-2080-7_23openalex-snapshot
Problems About Planar Orders
inferred← citeshttps://doi.org/10.1007/978-94-017-0697-1_9openalex-snapshot
Reading, Drawing, and Order
inferred← citeshttps://doi.org/10.1007/bf00334848openalex-snapshot
Matchings and radon transforms in lattices. I. Consistent lattices
inferred← citeshttps://doi.org/10.1007/bf00582747openalex-snapshot
Unsolved problems
inferred← citeshttps://doi.org/10.1007/bf01111297openalex-snapshot
Varieties generated by lattices of breadth two
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/bf02572532openalex-snapshot
Continuous modular lattices of breadth two
inferred← citeshttps://doi.org/10.1007/s00012-016-0405-0openalex-snapshot
A proof of Frankl’s union-closed sets conjecture for dismantlable lattices
inferred← citeshttps://doi.org/10.1007/s11083-020-09544-1openalex-snapshot
Medians are Below Joins in Semimodular Lattices of Breadth 2
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90029-2openalex-snapshot
Path length in the covering graph of a lattice
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90013-6openalex-snapshot
Matchings for linearly indecomposable modular lattices
inferred← citeshttps://doi.org/10.1016/0097-3165(82)90047-4openalex-snapshot
Matching in modular lattices
inferred← citeshttps://doi.org/10.1016/0097-3165(92)90006-gopenalex-snapshot
Consistent dually semimodular lattices
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
inferred← citeshttps://doi.org/10.29252/cgasa.11.1.197openalex-snapshot
Frankl's Conjecture for a subclass of semimodular lattices
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.