13 citations · 25 across the 15 of their papers we have counts for
1 paper · 1 filter
Eric Blais, Amit Weinstein, Yuichi Yoshida
For any c >= 2, a c-strong coloring of the hypergraph G is an assignment of colors to the vertices of G such that for every edge e of G, the vertices of e are colored by at least m…