15 citations · 23 across the 3 of their papers we have counts for
1 paper · 2 filters
Shai Gutner, Michael Tarsi
A solution to a problem of Erdős, Rubin and Taylor is obtained by showing that if a graph G is (a:b)-choosable, and c/d>a/b, then G is not necessarily (c:d)-choosable.…