1 citations · 1 across the 3 of their papers we have counts for
5 papers
Choice Functions
Ron Aharoni, Joseph Briggs
This is a survey paper on rainbow sets (another name for ``choice functions''). The main theme is the distinction between two types of choice functions: those having a large (in th…
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…
Rainbow independent sets in certain classes of graphs
Ron Aharoni, Joseph Briggs, Jinha Kim +1
For a given class of graphs and given integers , let be the minimal number such that every independent -sets in any graph be…
Choice functions in the intersection of matroids
Joseph Briggs, Minki Kim
We prove a common generalization of two results, one on rainbow fractional matchings and one on rainbow sets in the intersection of two matroids: Given $d = r \lceil k \rceil - r +…
Restricted online Ramsey numbers of matchings and trees
Joseph Briggs, Christopher Cox
Consider a two-player game between players Builder and Painter. Painter begins the game by picking a coloring of the edges of , which is hidden from Builder. In each round, Bu…