2 citations · 3 across the 2 of their papers we have counts for
12 papers
Line transversals in families of connected sets the plane
Daniel McGinnis, Shira Zerbib
We prove that if a family of compact connected sets in the plane has the property that every three members of it are intersected by a line, then there are three lines intersecting…
Rainbow paths and large rainbow matchings
Ron Aharoni, Eli Berger, Maria Chudnovsky +1
A conjecture of the first two authors is that matchings of size in any graph have a rainbow matching of size . We prove a lower bound of , improving on…
Large triangle packings and Tuza's conjecture in sparse random graphs
Patrick Bennett, Andrzej Dudek, Shira Zerbib
The triangle packing number of a graph is the maximum size of a set of edge-disjoint triangles in . Tuza conjectured that in any graph there exists a set of at mo…
On Lusztig-Dupont homology of flag complexes
Roy Meshulam, Shira Zerbib
Let be an -dimensional vector space over the finite field of order . The spherical building associated with is the order complex of the nontrivial linear su…
The geometry and combinatorics of discrete line segment hypergraphs
Deborah Oliveros, Christopher O'Neill, Shira Zerbib
An -segment hypergraph is a hypergraph whose edges consist of consecutive integer points on line segments in . In this paper, we bound the chromatic number…
Envy-free cake division without assuming the players prefer nonempty pieces
Frédéric Meunier, Shira Zerbib
Consider players having preferences over the connected pieces of a cake, identified with the interval . A classical theorem, found independently by Stromquist and by Woo…