12 citations · 23 across the 15 of their papers we have counts for
15 papers
On the Largest Convexity Number of Co-Finite Sets in the Plane
Chaya Keller, Micha A. Perles
The convexity number of a set is the minimum number of convex subsets required to cover it. We study the following question: what is the largest possible c…
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…
An -Theorem for -Transversals
Chaya Keller, Micha A. Perles
A family of sets satisfies the -property if among every members of , some can be pierced by a single point. The celebrated -theorem…
No Krasnoselskii number for general sets in
Chaya Keller, Micha A. Perles
For a family of sets in , the Krasnoselskii number of is the smallest such that for any , if every points of $S…
Blockers for simple Hamiltonian paths in convex geometric graphs of odd order
Chaya Keller, Micha A. Perles
Let G be a complete convex geometric graph, and let F be a family of subgraphs of G. A blocker for F is a set of edges, of smallest possible size, that has an edge in common with e…
Blockers for simple Hamiltonian paths in convex geometric graphs of even order
Chaya Keller, Micha A. Perles
Let G be a complete convex geometric graph on 2m vertices, and let F be a family of subgraphs of G. A blocker for F is a set of edges, of smallest possible size, that meets every e…