Yael Stein

collaborators

2 papers

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

Chaya Keller, Yael Stein

Let $G$ be a complete convex geometric graph whose vertex set $P$ forms a convex polygon $C$ , and let $F$ be a family of subgraphs of $G$ . A blocker for $F$ is a set of edges, of s…