On the public citation graph

On Geometric Graphs with No Two Edges in Convex Position

https://doi.org/10.1007/pl00009357
0 signed · 16 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-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferredcites →https://doi.org/10.1007/pl00009364openalex-snapshot
On Geometric Graphs with No k Pairwise Parallel Edges
inferredcites →https://doi.org/10.1016/s0304-0208(08)72827-5openalex-snapshot
On Pairs of Disjoint Segments in Convex Position in The Plane
inferredcites →https://doi.org/10.5860/choice.33-5161openalex-snapshot
Combinatorial geometry

What points at this work

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

inferred← citeshttps://doi.org/10.1006/eujc.1999.0353openalex-snapshot
Counting Pattern-free Set Partitions I: A Generalization of Stirling Numbers of the Second Kind
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_26openalex-snapshot
A Note on Geometric 3-Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_12openalex-snapshot
Extremal Configurations and Levels in Pseudoline Arrangements
inferred← citeshttps://doi.org/10.1007/pl00009364openalex-snapshot
On Geometric Graphs with No k Pairwise Parallel Edges
inferred← citeshttps://doi.org/10.1007/s00373-013-1335-7openalex-snapshot
The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges
inferred← citeshttps://doi.org/10.1007/s00493-008-2250-zopenalex-snapshot
Geometric graphs with no two parallel edges
inferred← citeshttps://doi.org/10.1007/s00493-025-00139-1openalex-snapshot
On the Number of Digons in Arrangements of Pairwise Intersecting Circles
inferred← citeshttps://doi.org/10.1007/s10474-009-9030-0openalex-snapshot
Ball polytopes and the Vázsonyi problem
inferred← citeshttps://doi.org/10.1016/j.aim.2021.107779openalex-snapshot
Planar point sets determine many pairwise crossing segments
inferred← citeshttps://doi.org/10.1016/j.disc.2013.03.001openalex-snapshot
A note on light geometric graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2006.10.007openalex-snapshot
Linear algebra approach to geometric graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2007.08.006openalex-snapshot
A new proof of Vázsonyi's conjecture
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.