On the public citation graph
A Radon theorem for Helly graphs
0 signed · 24 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.3190110416openalex-snapshot
Minimal extensions of graphs to absolute retracts
inferredcites →https://doi.org/10.1007/978-3-0348-5765-9_6openalex-snapshot
Radon’s theorem revisited
inferredcites →https://doi.org/10.1007/978-3-642-46908-4_7openalex-snapshot
Helly Theorems for Dismantlable Graphs and Pseudo-Modular Graphs
inferredcites →https://doi.org/10.1016/0012-365x(83)90159-0openalex-snapshot
The smallest graph variety containing all paths
inferredcites →https://doi.org/10.1016/0095-8956(88)90039-1openalex-snapshot
Convex sets in graphs, II. Minimal path convexity
inferredcites →https://doi.org/10.1016/0097-3165(85)90061-5openalex-snapshot
On the helly property working as a compactness criterion on graphs
inferredcites →https://doi.org/10.1016/0166-8641(83)90009-3openalex-snapshot
Finite dimensional convex structures II: the invariants
inferredcites →https://doi.org/10.1016/0166-8641(83)90019-6openalex-snapshot
Matching binary convexities
inferredcites →https://doi.org/10.1016/s0195-6698(89)80053-8openalex-snapshot
DismantlinG Absolute Retracts of Reflexive Graphs
inferredcites →https://doi.org/10.1090/conm/057/856237openalex-snapshot
Retracts: graphs and ordered sets from the metric point of view
inferredcites →https://doi.org/10.1112/jlms/s1-41.1.123openalex-snapshot
A Generalization of Radon's Theorem
inferredcites →https://doi.org/10.2140/pjm.1981.96.115openalex-snapshot
Partition numbers for trees and ordered sets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.10120openalex-snapshot
On constructible graphs, locally Helly graphs, and convexity
inferred← citeshttps://doi.org/10.1002/net.21998openalex-snapshot
A story of diameter, radius, and (almost) Helly property
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_22openalex-snapshot
Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_25openalex-snapshot
Beyond Helly Graphs: The Diameter Problem on Absolute Retracts
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_23openalex-snapshot
On the Radon Number for P 3-Convexity
inferred← citeshttps://doi.org/10.1007/bf01195713openalex-snapshot
Tverberg numbers for cellular bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.02.017openalex-snapshot
Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.05.002openalex-snapshot
An upper bound on the P 3 -Radon number
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103606openalex-snapshot
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113690openalex-snapshot
Distance problems within Helly graphs and k-Helly graphs
inferred← citeshttps://doi.org/10.1023/a:1004348709807openalex-snapshot
Intersection Theorems for Infinite Families of Convex Sets in Graphs
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.