3 citations · 10 across the 21 of their papers we have counts for
4 papers · 1 filter
Fair representation by independent sets
Ron Aharoni, Noga Alon, Eli Berger +4
For a hypergraph let denote the minimal number of edges from covering . An edge of is said to represent {\em fairly} (resp. {\em almost fairly}) a part…
Degree conditions for matchability in -partite hypergraphs
Ron Aharoni, Eli Berger, Dani Kotlar +1
We study conjectures relating degree conditions in -partite hypergraphs to the matching number of the hypergraph, and use topological methods to prove special cases. In particul…
On a conjecture of Stein
Ron Aharoni, Eli Berger, Dani Kotlar +1
Stein proposed the following conjecture: if the edge set of is partitioned into sets, each of size , then there is a partial rainbow matching of size . He pro…
Representation of large matchings in bipartite graphs
Ron Aharoni, Dani Kotlar, Ran Ziv
Let be the smallest number such that every collection of matchings, each of size at least , in a bipartite graph, has a full rainbow matching. Generalizing famous…