21 citations · 37 across the 25 of their papers we have counts for
4 papers · 1 filter
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…
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…
On Weak Flexibility in Planar Graphs
Bernard Lidický, Tomáš Masařík, Kyle Murphy +1
Recently, Dvořák, Norin, and Postle introduced flexibility as an extension of list coloring on graphs [JGT 19']. In this new setting, each vertex in some subset of has a…
Tournaments and the Strong Erdős-Hajnal Property
Eli Berger, Krzysztof Choromanski, Maria Chudnovsky +1
A conjecture of Alon, Pach and Solymosi, which is equivalent to the celebrated Erdős-Hajnal Conjecture, states that for every tournament there exists such that if …