On the public citation graph

Convex independent sets and 7-holes in restricted planar point sets

https://doi.org/10.1007/bf02187831
0 signed · 56 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-0-8176-4842-8_3openalex-snapshot
A Combinatorial Problem in Geometry
inferredcites →https://doi.org/10.1007/bf02187725openalex-snapshot
The maximum size of a convex polygon in a restricted set of points in the plane
inferredcites →https://doi.org/10.4153/cmb-1983-077-8openalex-snapshot
Sets with No Empty Convex 7-Gons
inferredcites →https://doi.org/10.5169/seals-32945openalex-snapshot
Konvexe Fünfecke in ebenen Punktmengen

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-4614-7254-4_13openalex-snapshot
Ramsey Theory in the Work of Paul Erdős
inferred← citeshttps://doi.org/10.1007/978-1-4614-7258-2_36openalex-snapshot
On Mutually Avoiding Sets
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_4openalex-snapshot
On Erdős–Szekeres-Type Problems for k-convex Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_115openalex-snapshot
No Selection Lemma for Empty Triangles
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_17openalex-snapshot
A SAT Attack on Higher Dimensional Erdős–Szekeres Numbers
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_6openalex-snapshot
General Position Subset Selection in Line Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_30openalex-snapshot
Drawing Graphs Using a Small Number of Obstacles
inferred← citeshttps://doi.org/10.1007/978-3-319-32162-2_10openalex-snapshot
The Erdős-Szekeres Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-48532-4_1openalex-snapshot
A Note on the Number of General 4-holes in (Perturbed) Grids
inferred← citeshttps://doi.org/10.1007/978-3-319-78825-8_14openalex-snapshot
Holes in 2-Convex Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_33openalex-snapshot
The Visible Perimeter of an Arrangement of Disks
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_16openalex-snapshot
Ramsey Theory in the Work of Paul Erdős
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_30openalex-snapshot
On Mutually Avoiding Sets
inferred← citeshttps://doi.org/10.1007/bf01844852openalex-snapshot
Lines, line-point incidences and crossing families in dense sets
inferred← citeshttps://doi.org/10.1007/pl00009291openalex-snapshot
Cutting dense point sets in half
inferred← citeshttps://doi.org/10.1007/s00373-010-0957-2openalex-snapshot
Every Large Point Set contains Many Collinear Points or an Empty Pentagon
inferred← citeshttps://doi.org/10.1007/s00373-025-03006-4openalex-snapshot
Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
inferred← citeshttps://doi.org/10.1007/s00454-003-2927-4openalex-snapshot
Nice Point Sets Can Have Nasty Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-004-1089-3openalex-snapshot
Dense Point Sets Have Sparse Delaunay Triangulations or ?... But Not Too Nasty?
inferred← citeshttps://doi.org/10.1007/s00454-006-1286-3openalex-snapshot
Open Caps and Cups in Planar Point Sets
inferred← citeshttps://doi.org/10.1007/s00454-007-1334-7openalex-snapshot
Ball-Polyhedra
inferred← citeshttps://doi.org/10.1007/s00454-017-9919-2openalex-snapshot
Drawing Graphs Using a Small Number of Obstacles
inferred← citeshttps://doi.org/10.1007/s00454-017-9931-6openalex-snapshot
Point Sets with Small Integer Coordinates and No Large Convex Polygons
inferred← citeshttps://doi.org/10.1007/s00454-023-00561-6openalex-snapshot
Fixing a Hole
inferred← citeshttps://doi.org/10.1007/s00454-024-00691-5openalex-snapshot
Erdős–Szekeres-Type Problems in the Real Projective Plane
inferred← citeshttps://doi.org/10.1007/s10474-024-01431-0openalex-snapshot
No selection lemma for empty triangles
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90665-3openalex-snapshot
Sets in Rd with no large empty convex subsets
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50027-0openalex-snapshot
10.1016/b978-044488002-4/50027-0
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.08.006openalex-snapshot
The visible perimeter of an arrangement of disks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.12.004openalex-snapshot
4-Holes in point sets
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.12.007openalex-snapshot
On k-gons and k-holes in point sets
inferred← citeshttps://doi.org/10.1016/j.comgeo.2018.06.002openalex-snapshot
Holes in 2-convex point sets
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101731openalex-snapshot
Empty rainbow triangles in k-colored point sets
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103157openalex-snapshot
On Erdős–Szekeres-type problems for k -convex point sets
inferred← citeshttps://doi.org/10.1016/j.jcta.2020.105236openalex-snapshot
A superlinear lower bound on the number of 5-holes
inferred← citeshttps://doi.org/10.1016/j.jcta.2026.106195openalex-snapshot
The Erdős–Szekeres conjecture revisited
inferred← citeshttps://doi.org/10.1017/s0963548300001024openalex-snapshot
A Ramsey-Type Theorem in the Plane
inferred← citeshttps://doi.org/10.1090/s0273-0979-00-00877-6openalex-snapshot
The Erdos-Szekeres problem on points in convex position – a survey
inferred← citeshttps://doi.org/10.1134/s0001434618030082openalex-snapshot
Almost Empty Monochromatic Quadrilaterals in Planar Point Sets
inferred← citeshttps://doi.org/10.1137/24m1685365openalex-snapshot
Two Trees Are Better than One
inferred← citeshttps://doi.org/10.1145/177424.177648openalex-snapshot
Cutting dense point sets in half
inferred← citeshttps://doi.org/10.1556/012.2024.04308openalex-snapshot
Two-Sided Convexity Testing with Certificates
inferred← citeshttps://doi.org/10.1556/sscmath.36.2000.1-2.9openalex-snapshot
Planar sets with few empty convex polygons
inferred← citeshttps://doi.org/10.1556/sscmath.40.2003.3.1openalex-snapshot
Almost empty polygons
inferred← citeshttps://doi.org/10.1556/sscmath.41.2004.2.4openalex-snapshot
Planar point sets with a small number of empty convex polygons
inferred← citeshttps://doi.org/10.17846/amn.2015.1.1.24-43openalex-snapshot
Some Famous Problems of Discrete Geometry
inferred← citeshttps://doi.org/10.19086/aic.2025.1openalex-snapshot
Convex polytopes in restricted point sets in R^d
inferred← citeshttps://doi.org/10.3390/a18060315openalex-snapshot
General Position Subset Selection in Line Arrangements
inferred← citeshttps://doi.org/10.48550/arxiv.1409.0081openalex-snapshot
On $k$-Gons and $k$-Holes in Point Sets
inferred← citeshttps://doi.org/10.48550/arxiv.2204.02487openalex-snapshot
Convex polytopes in restricted point sets in $\mathbb{R}^d$
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0110030openalex-snapshot
Dense point sets have sparse Delaunay triangulations
inferred← citeshttps://doi.org/10.5555/545381.545397openalex-snapshot
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
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.