1 citations · 1 across the 24 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
math.CO2025
Complements of finite unions of convex sets
Chaya Keller, Micha A. Perles
Finite unions of convex sets are a central object of study in discrete and computational geometry. In this paper we initiate a systematic study of complements of such unions -- i.e…
math.CO2025
On saturated triangulation-free convex geometric graphs
David Garber, Chaya Keller, Olga Nissenbaum +1
A convex geometric graph is a graph whose vertices are the corners of a convex polygon P in the plane and whose edges are boundary edges and diagonals of the polygon. It is called…
math.CO2025
New Sufficient Conditions for Linear-Sized Epsilon-Nets and -Theorems
Chaya Keller, Shakhar Smorodinsky
An -net theorem for a hypergraph upper bounds the minimum size of a vertex set that pierces all -heavy hyperedges. A -theorem bounds from above the minimum size of a v…