On the public citation graph

The maximum number of second smallest distances in finite planar sets

https://doi.org/10.1007/bf02187849
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/978-1-4612-2130-2_6openalex-snapshot
Infinite and Finite Sets
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bf02579184openalex-snapshot
On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
inferredcites →https://doi.org/10.1016/0012-365x(87)90027-6openalex-snapshot
On large distances in planar sets
inferredcites →https://doi.org/10.1016/0097-3165(84)90047-5openalex-snapshot
Unit distances
inferredcites →https://doi.org/10.1080/00029890.1970.11992573openalex-snapshot
On Sets of Distances of n Points
inferredcites →https://doi.org/10.1080/00029890.1989.11972243openalex-snapshot
A Problem of Leo Moser About Repeated Distances on the Sphere
inferredcites →https://doi.org/10.2307/2305092openalex-snapshot
On Sets of Distances of n Points

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118033203.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_12openalex-snapshot
Recent Developments in Combinatorial Geometry
inferred← citeshttps://doi.org/10.1007/s10474-019-00972-zopenalex-snapshot
Ordinal spaces
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00208-eopenalex-snapshot
On the Erdős-diameter of sets
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00043-7openalex-snapshot
Geometric orderings of intersecting translates and their applications
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00055-0openalex-snapshot
The shortest distance among points in general position
inferred← citeshttps://doi.org/10.1016/j.disc.2013.05.007openalex-snapshot
Small distances in convex polygons
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.04.003openalex-snapshot
On stars and Steiner stars
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00116-2openalex-snapshot
The multiplicity of the two smallest distances among points
inferred← citeshttps://doi.org/10.2140/cnt.2025.14.75openalex-snapshot
General penny graphs are at most -dense
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.