Chaya Keller

activity

20102020

collaborators

11 papers

math.CO2020

No Krasnoselskii number for general sets in $R^{2}$

Chaya Keller, Micha A. Perles

For a family $F$ of sets in $R^{d}$ , the Krasnoselskii number of $F$ is the smallest $m$ such that for any $S \in F$ , if every $m$ points of $S…

math.CO2019

On sets of $n$ points in general position that determine lines that can be pierced by $n$ points

Chaya Keller, Rom Pinchasi

Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of $n$ points disjoint from $P$ such that for every $x, y \in P$ the line through $x$ and $y$ conta…

math.CO2018

A new lower bound on Hadwiger-Debrunner numbers in the plane

Chaya Keller, Shakhar Smorodinsky

A family of sets $F$ is said to satisfy the $(p, q)$ property if among any $p$ sets in $F$ , some $q$ have a non-empty intersection. Hadwiger and Debrunner (1957) conjectured that fo…

math.CO2018

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…

math.CO2017

Reconstruction of the Path Graph

Chaya Keller, Yael Stein

Let $P$ be a set of $n \geq 5$ points in convex position in the plane. The path graph $G (P)$ of $P$ is an abstract graph whose vertices are non-crossing spanning paths of $P$ , such…

math.CO2017

Blockers for Triangulations of a Convex Polygon and a Geometric Maker-Breaker Game