1 citations · 1 across the 7 of their papers we have counts for
4 papers · 2 filters
Fractionally balanced hypergraphs and rainbow KKM theorems
Ron Aharoni, Eli Berger, Joseph Briggs +2
A d-partite hypergraph is called *fractionally balanced* if there exists a non-negative, not identically zero, function on its edge set that has constant degrees in each vertex sid…
Rainbow odd cycles
Ron Aharoni, Joseph Briggs, Ron Holzman +1
We prove that every family of (not necessarily distinct) odd cycles in the complete graph on vertices has a rainbow odd cycle (that…
Badges and rainbow matchings
Ron Aharoni, Joseph Briggs, Jinha Kim +1
Drisko proved that matchings of size in a bipartite graph have a rainbow matching of size . For general graphs it is conjectured that matchings suffice for this…
Cooperative conditions for the existence of rainbow matchings
Ron Aharoni, Joseph Briggs, Minho Cho +1
Let , and let be a family of non-empty sets of edges in a bipartite graph. If the union of every members of contains a matching of siz…